Strongly Separable Codes
Jing Jiang, Minquan Cheng, Ying Miao

TL;DR
This paper introduces binary strongly separable codes to enhance multimedia fingerprinting, providing new constructions and demonstrating they contain more codewords than traditional frameproof codes, with specific focus on length 2 and 3 codes.
Contribution
It proposes binary strongly separable codes, offers a composition construction from q-ary codes, and derives optimal and larger codes for lengths 2 and 3.
Findings
Binary strongly separable codes have the same traceability as t-FPCs.
Constructed q-ary -SSCs of length 2 are optimal and larger than t-FPCs.
Developed a construction for q-ary -SSCs of length 3 with over 12.5% more codewords.
Abstract
Binary -frameproof codes (-FPCs) are used in multimedia fingerprinting schemes where the identification of authorized users taking part in the averaging collusion attack is required. In this paper, a binary strongly -separable code (-SSC) is introduced to improve such a scheme based on a binary -FPC. A binary -SSC has the same traceability as a binary -FPC but has more codewords than a binary -FPC. A composition construction for binary -SSCs from -ary -SSCs is described, which stimulates the research on -ary -SSCs with short length. Several infinite series of optimal -ary -SSCs of length are derived from the fact that a -ary -SSC of length is equivalent to a -ary -separable code of length . Combinatorial properties of -ary -SSCs of length are…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Steganography and Watermarking Techniques · graph theory and CDMA systems · Coding theory and cryptography
