Codes with the identifiable parent property for multimedia fingerprinting
From MaRDI portal
Publication:517266
DOI10.1007/S10623-016-0203-XzbMath1379.94051arXiv1411.6784OpenAlexW3104897092MaRDI QIDQ517266
Minquan Cheng, Yuan-Hsun Lo, Ying Miao, Jing Jiang, Hung-Lin Fu
Publication date: 23 March 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1411.6784
Related Items (3)
Multimedia IPP codes with efficient tracing ⋮ Codes with the identifiable parent property for multimedia fingerprinting ⋮ A study of the separating property in Reed-Solomon codes by bounding the minimum distance
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Codes with the identifiable parent property for multimedia fingerprinting
- On codes with the identifiable parent property
- New constructions for IPP codes
- A class of I.P.P. codes with efficient identification
- An upper bound on the size of a code with the \(k\)-identifiable parent property
- Graphs without cycles of even length
- A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
- New Bounds on Separable Codes for Multimedia Fingerprinting
- On extremal bipartite graphs with high girth
- A recursive approach to low complexity codes
- Which codes have cycle-free Tanner graphs?
- Combinatorial properties of frameproof and traceability codes
- Digital fingerprinting codes: problem statements, constructions, identification of traitors
- Separable Codes
- On Anti-Collusion Codes and Detection Algorithms for Multimedia Fingerprinting
- Nonrandom binary superimposed codes
- Anti-collusion fingerprinting for multimedia
This page was built for publication: Codes with the identifiable parent property for multimedia fingerprinting