Asymptotically optimal 2-separable codes with length 4

DOI10.1007/S12095-016-0182-9MaRDI QIDQ507954zbMATH OpenOpenAlexFDO

Authors Minquan Cheng, Jing Jiang, Xiaohu Tang

Publication date 9 February 2017

Published in Cryptography and Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12095-016-0182-9

zbMATH Keywords

multimedia fingerprintingseparable codeasymptotically optimal

Mathematics Subject Classification ID

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

Recommendations

• \(\overline{2}\)-separable codes with length 5
• Strongly separable codes
• New bounds on \(\bar{2}\)-separable codes of length 2
• LATIN 2004: Theoretical Informatics
• Multimedia IPP codes with efficient tracing

Cites work

• Anti-collusion fingerprinting for multimedia
• Collusion-secure fingerprinting for digital data
• Combinatorial properties of frameproof and traceability codes
• Frameproof Codes
• New Bounds on Separable Codes for Multimedia Fingerprinting
• New bounds on \(\bar{2}\)-separable codes of length 2
• On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
• On codes with the identifiable parent property
• Probabilistic Existence Results for Separable Codes
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Separable Codes

Cited in

(10)

• LATIN 2004: Theoretical Informatics
• Strongly separable codes
• Universal lower bounds on energy and LP-extremal polynomials for \((4, 24)\)-codes
• New bounds on \(\bar{2}\)-separable codes of length 2
• \(\overline{2}\)-separable codes with length 5
• Complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise with optimal rate
• Bounds and constructions for \(\overline{3}\)-separable codes with length 3
• Spectrum of sizes for perfect 2-deletion-correcting codes of length 4
• Multimedia IPP codes with efficient tracing
• Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3

This page was built for publication: Asymptotically optimal \(\overline {2}\)-separable codes with length 4

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