Separable Codes
Separable Codes
复制标题
DOI：
10.1109/tit.2011.2174614
复制
发表时间：
2012-03
影响因子：
2.5
通讯作者：
Minquan Cheng;L. Ji;Y. Miao
中科院分区：
文献类型：
--
作者：
Minquan Cheng;L. Ji;Y. Miao
多媒体指纹技术是一种有效的追踪多媒体信息盗版来源的技术。可分离码可以用来构造抵抗多媒体内容上的平均合谋攻击的指纹。本文从组合的角度研究了-可分码.首先给出了非可分码的码长的几个上界，然后讨论了短码长的最优非可分码的构造问题。从射影平面上构造了两个长度为2的最佳可分码的无限族，并借助于差矩阵显式地构造了所有长度为3的最佳可分码。这些短码长的最佳可分码可以通过已知的合成构造构造出长码长的良好可分码。
Multimedia fingerprinting is an effective technique to trace the sources of pirate copies of copyrighted multimedia information. Separable codes can be used to construct fingerprints resistant to the averaging collusion attack on multimedia contents. In this paper, we investigate -separable codes from a combinatorial point of view. We first derive several upper bounds on the sizes of -separable codes, and then turn our attention to the constructions of optimal -separable codes with short length. Two infinite families of optimal -separable codes of length 2 are constructed from projective planes, and all optimal -separable codes of length 3 are explicitly constructed by means of difference matrices. These optimal -separable codes with short length can be used to construct good -separable codes with long length by a known composition construction.