Traceability codes

DOI10.1016/j.jcta.2010.02.009zbMath1230.94004OpenAlexW2911455720MaRDI QIDQ1957960

Simon R. Blackburn, Tuvi Etzion, Siaw-Lynn Ng

Publication date: 27 September 2010

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcta.2010.02.009

zbMATH Keywords

probabilistic constructionIPP codetraceability code

Mathematics Subject Classification ID

Other types of codes (94B60) Combinatorial codes (94B25)

Related Items (7)

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 ⋮ Traceability codes and their generalizations ⋮ On non-binary traceability set systems ⋮ Optimal 2-traceability codes of length 4 ⋮ Wide-sense 2-frameproof codes ⋮ Improved bounds on 2-frameproof codes with length 4

Uses Software

• I.P.P.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On codes with the identifiable parent property
• On a class of traceability 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
• Codes for copyright protection: the case of two pirates
• Combinatorial Properties for Traceability Codes Using Error Correcting Codes
• Combinatorial properties of frameproof and traceability codes
• New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
• A class of traceability codes
• Digital fingerprinting codes: problem statements, constructions, identification of traitors
• Paths in graphs
• A Note About the Traceability Properties of Linear Codes

This page was built for publication: Traceability codes