Optimal 2-traceability codes of length 4
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1996248 (Why is no real title available?)
- scientific article; zbMATH DE number 1406785 (Why is no real title available?)
- A Note About the Traceability Properties of Linear Codes
- A class of I.P.P. codes with efficient identification
- A class of traceability codes
- A note on an upper bound of traceability codes
- An upper bound on the size of a code with the \(k\)-identifiable parent property
- Applications of list decoding to tracing traitors
- Codes for copyright protection: the case of two pirates
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Combinatorial Properties for Traceability Codes Using Error Correcting Codes
- Combinatorial properties of frameproof and traceability codes
- Digital fingerprinting codes: problem statements, constructions, identification of traitors
- Frameproof Codes
- New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
- New upper bounds for parent-identifying codes and traceability codes
- On a class of traceability codes
- On codes with the identifiable parent property
- Parent-identifying codes
- Traceability codes
- Traceability codes and their generalizations
- Tracing traitors
This page was built for publication: Optimal 2-traceability codes of length 4
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2697541)
