Asymptotically optimal \(\overline {2}\)-separable codes with length 4

DOI10.1007/s12095-016-0182-9zbMath1366.94660OpenAlexW2464863419MaRDI QIDQ507954

Minquan Cheng, Xiaohu Tang, Jing Jiang

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

asymptotically optimalmultimedia fingerprintingseparable code

Mathematics Subject Classification ID

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

Related Items (2)

\(\overline{2}\)-separable codes with length 5 ⋮ Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3

Cites Work

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

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