Separable Codes
From MaRDI portal
Publication:5272069
DOI10.1109/TIT.2011.2174614zbMath1365.94569MaRDI QIDQ5272069
Minquan Cheng, Lijun Ji, Ying Miao
Publication date: 12 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (12)
Strongly separable codes ⋮ Bounds and constructions for \(\overline{3}\)-separable codes with length 3 ⋮ Multimedia IPP codes with efficient tracing ⋮ \(\overline{2}\)-separable codes with length 5 ⋮ Bounds and constructions for \(\overline {3}\)-strongly separable codes with length 3 ⋮ Complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise with optimal rate ⋮ Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing ⋮ 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 ⋮ Improved bounds on 2-frameproof codes with length 4 ⋮ Separable collusion-secure multimedia codes
This page was built for publication: Separable Codes
