Improved Bounds for Separable Codes and $B_2$ Codes

IEEE Communications Letters（2020）

引用 5|浏览12

暂无评分

摘要

Separable codes and

$B_{2}$

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

$B_{2}$

codes, which improve the existing results when the alphabet size

$q$

is relatively small.

查看译文

关键词

Upper bound,Fans,Transmitters,Media,Indexes,Multimedia communication,Logic gates

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要