New Bounds on Separable Codes for Multimedia Fingerprinting

DOI10.1109/TIT.2014.2331989MaRDI QIDQ2986143zbMATH OpenOpenAlexFDO

Authors Fei Gao, Gennian Ge

Publication date 16 May 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2014.2331989

Mathematics Subject Classification ID

Cryptography (94A60) Other types of codes (94B60)

Cited in

(11)

• Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
• Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise
• Strongly separable codes
• \(\overline{2}\)-separable codes with length 5
• List decoding for a multiple access hyperchannel
• Constructions and bounds for separating hash families
• New Bounds and Constructions for Granular Media Coding
• Asymptotically optimal \(\overline {2}\)-separable codes with length 4
• Multimedia IPP codes with efficient tracing
• Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3
• Codes with the identifiable parent property for multimedia fingerprinting

This page was built for publication: New Bounds on Separable Codes for Multimedia Fingerprinting

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