Author :
Cheng, Minquan ; Ji, Lijun ; Miao, Ying
Author_Institution :
Dept. of Social Syst. & Manage., Univ. of Tsukuba, Tsukuba, Japan
fDate :
3/1/2012 12:00:00 AM
Abstract :
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.
Keywords :
computer crime; copyright; encoding; fingerprint identification; multimedia systems; averaging collusion attack; combinatorial point of view; composition construction; copyrighted multimedia information; difference matrix; multimedia content; multimedia fingerprinting; optimal 2-separable code; projective plane; t-separable code; Bismuth; Indexes; Modulation; Multimedia communication; Optimization; Upper bound; Vectors; AND anti-collusion code (AND-ACC); difference matrix; frameproof code (FPC); logical anti-collusion code (LACC); optimal code; projective plane; separable code (SC); upper bound;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2011.2174614
