A class of I.P.P. codes with efficient identification
From MaRDI portal
Publication:1827562
DOI10.1016/j.jco.2003.08.012zbMath1069.68045OpenAlexW2040167287MaRDI QIDQ1827562
Alexander Barg, Grigory Kabatiansky
Publication date: 6 August 2004
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jco.2003.08.012
Related Items
Analysis of properties of \(q\)-ary Reed-Muller error-correcting codes viewed as codes for copyright protection ⋮ New upper bounds for parent-identifying codes and traceability codes ⋮ Multimedia IPP codes with efficient tracing ⋮ Traceability codes and their generalizations ⋮ Optimal 2-traceability codes of length 4 ⋮ Traceability codes ⋮ On generalized separating hash families ⋮ Codes with the identifiable parent property for multimedia fingerprinting ⋮ A class of I.P.P. codes with efficient identification ⋮ A study of the separating property in Reed-Solomon codes by bounding the minimum distance
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On codes with the identifiable parent property
- Generalized hashing and parent-identifying codes.
- A class of I.P.P. codes with efficient identification
- A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Improved decoding of Reed-Solomon and algebraic-geometry codes
- Combinatorial properties of frameproof and traceability codes
- A low-complexity algorithm for the construction of algebraic-geometric codes better than the Gilbert-Varshamov bound
- Tracing traitors
- Digital fingerprinting codes: problem statements, constructions, identification of traitors
- Collusion-secure fingerprinting for digital data
