Separable Codes

DOI10.1109/TIT.2011.2174614MaRDI QIDQ5272069zbMATH OpenFDO

Authors Minquan Cheng, Lijun Ji, Ying Miao

Publication date 12 July 2017

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

Full work available at URL https://doi.org/10.1109/TIT.2011.2174614

Mathematics Subject Classification ID

Combinatorial codes (94B25)

Cited in

(19)

• Divisible codes
• Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3
• Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing
• Improved bounds on 2-frameproof codes with length 4
• Separable collusion-secure multimedia codes
• Multimedia IPP codes with efficient tracing
• Complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise with optimal rate
• Strongly separable codes
• Bounds and constructions for \(\overline{3}\)-separable codes with length 3
• Upper Bounds on Separating Codes
• New bounds on \(\bar{2}\)-separable codes of length 2
• Asymptotically optimal \(\overline {2}\)-separable codes with length 4
• Codes with the identifiable parent property for multimedia fingerprinting
• \(\overline{2}\)-separable codes with length 5
• Frameproof codes, separable codes and \(B_2\) codes: bounds and constructions
• Constructions of \(t\)-strongly multimedia IPP codes with length \(t+1\)
• Codes with a disparity property
• On anti-collusion codes for averaging attack in multimedia fingerprinting
• Constructions of \(\bar{3}\)-separable codes with length 4

This page was built for publication: Separable Codes

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