TY - JOUR
T1 - Improved Bounds for Separable Codes and B2 Codes
AU - Gu, Yujie
AU - Fan, Jinping
AU - Miao, Ying
N1 - Funding Information:
Manuscript received July 30, 2019; revised September 7, 2019; accepted October 2, 2019. Date of publication October 7, 2019; date of current version January 8, 2020. Research supported by JSPS Grant-in-Aid for Scientific Research (B) under Grant No. 18H01133. The associate editor coordinating the review of this letter and approving it for publication was B. Matuz. (Corresponding author: Yujie Gu.) Y. Gu is with the Department of Electrical Engineering–Systems, Tel Aviv University, Tel Aviv 6997801, Israel (e-mail: guyujie2016@gmail.com).
Publisher Copyright:
© 2019 IEEE.
Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2020/1
Y1 - 2020/1
N2 - Separable codes and B2 codes are combinatorial structures which could be applied to identify traitors in multimedia fingerprinting and to uniquely decode messages in multiple access communication respectively. In this letter we provide new lower and upper bounds for the largest code rates of q-ary separable codes and B2 codes, which improve the existing results when the alphabet size q is relatively small.
AB - Separable codes and B2 codes are combinatorial structures which could be applied to identify traitors in multimedia fingerprinting and to uniquely decode messages in multiple access communication respectively. In this letter we provide new lower and upper bounds for the largest code rates of q-ary separable codes and B2 codes, which improve the existing results when the alphabet size q is relatively small.
UR - http://www.scopus.com/inward/record.url?scp=85078225049&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85078225049&partnerID=8YFLogxK
U2 - 10.1109/LCOMM.2019.2945948
DO - 10.1109/LCOMM.2019.2945948
M3 - Article
AN - SCOPUS:85078225049
SN - 1089-7798
VL - 24
SP - 15
EP - 19
JO - IEEE Communications Letters
JF - IEEE Communications Letters
IS - 1
M1 - 8861395
ER -