New Bounds on Separable Codes for Multimedia Fingerprinting
From MaRDI portal
Publication:2986143
DOI10.1109/TIT.2014.2331989zbMath1360.94455OpenAlexW1997166677MaRDI QIDQ2986143
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
Related Items (9)
List decoding for a multiple access hyperchannel ⋮ Strongly separable codes ⋮ 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 ⋮ Signature codes for weighted noisy adder channel, multimedia fingerprinting and compressed sensing ⋮ Asymptotically optimal \(\overline {2}\)-separable codes with length 4 ⋮ Codes with the identifiable parent property for multimedia fingerprinting ⋮ Constructions and bounds for separating hash families
This page was built for publication: New Bounds on Separable Codes for Multimedia Fingerprinting