Strongly separable codes

DOI10.1007/S10623-015-0050-1zbMATH Open1405.94103arXiv1412.6128OpenAlexW2132482824MaRDI QIDQ285247FDOQ285247

Authors: Jing Jiang, Minquan Cheng, Ying Miao 

Publication date: 19 May 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: Binary $t$-frameproof codes ($t$-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 $t$-FPC. A binary $$-SSC has the same traceability as a binary $t$-FPC but has more codewords than a binary $t$-FPC. A composition construction for binary $$-SSCs from $q$-ary $$-SSCs is described, which stimulates the research on $q$-ary $$-SSCs with short length. Several infinite series of optimal $q$-ary $$-SSCs of length $2$ are derived from the fact that a $q$-ary $$-SSC of length $2$ is equivalent to a $q$-ary $$-separable code of length $2$. Combinatorial properties of $q$-ary $$-SSCs of length $3$ are investigated, and a construction for $q$-ary $$-SSCs of length $3$ is provided. These $$-SSCs of length $3$ have more than $12.5\mathrm{\%}$ codewords than $2$-FPCs of length $3$ could have.

Full work available at URL: https://arxiv.org/abs/1412.6128

Recommendations

• Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3
• Asymptotically optimal \(\overline {2}\)-separable codes with length 4
• \(\overline{2}\)-separable codes with length 5
• LATIN 2004: Theoretical Informatics
• New bounds on \(\bar{2}\)-separable codes of length 2

zbMATH Keywords

frameproof codemultimedia fingerprintingseparable codestrongly separable codetracing algorithm

Mathematics Subject Classification ID

Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial codes (94B25) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Generalized hashing and parent-identifying codes.
• Title not available (Why is that?)
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Bounds for separating hash families
• New Bounds on Separable Codes for Multimedia Fingerprinting
• Frameproof Codes
• Collusion-secure fingerprinting for digital data
• New bounds on \(\bar{2}\)-separable codes of length 2
• Separable Codes
• On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
• Anti-collusion fingerprinting for multimedia

Cited In (8)

• Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
• \(\overline{2}\)-separable codes with length 5
• Constructions of \(t\)-strongly multimedia IPP codes with length \(t+1\)
• Strongly separable matrices for nonadaptive combinatorial group testing
• Multimedia IPP codes with efficient tracing
• Upper Bounds on Separating Codes
• Strongly Conflict-Avoiding Codes
• Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3

This page was built for publication: Strongly separable codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q285247)