Paper Info
Title
Improved Bounds for Separable Codes and $B_2$ Codes
Abstract
Separable codes and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$B_{2}$ </tex-math></inline-formula> 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 <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula> -ary separable codes and <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$B_{2}$ </tex-math></inline-formula> codes, which improve the existing results when the alphabet size <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula> is relatively small.
Year
DOI
Venue
2020
10.1109/LCOMM.2019.2945948
IEEE Communications Letters
Keywords
DocType
Volume
Upper bound,Fans,Transmitters,Media,Indexes,Multimedia communication,Logic gates
Journal
24
Issue
ISSN
Citations 
1
1089-7798
0
PageRank 
References 
Authors
0.34
0
3
Name
Order
Citations
PageRank
Yujie Gu100.34
Jinping Fan200.34
Ying Miao349143.85