On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
From MaRDI portal
Publication:5273579
DOI10.1109/TIT.2011.2146130zbMath1365.94092MaRDI QIDQ5273579
Publication date: 12 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Detection theory in information and communication theory (94A13) Authentication, digital signatures and secret sharing (94A62)
Related Items (19)
Strongly separable codes ⋮ Bounds and constructions for \(\overline{3}\)-separable codes with length 3 ⋮ New upper bounds for parent-identifying codes and traceability codes ⋮ Multimedia IPP codes with efficient tracing ⋮ \(\overline{2}\)-separable codes with length 5 ⋮ Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory ⋮ 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 ⋮ Wide-sense 2-frameproof codes ⋮ Improved upper bounds for parent-identifying set systems and separable codes ⋮ 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 ⋮ 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 ⋮ Quaternary splitting algorithm in group testing ⋮ Separable collusion-secure multimedia codes ⋮ A note on \(\overline{2} \)-separable codes and \(B_2\) codes
This page was built for publication: On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
