A Note About the Traceability Properties of Linear Codes
From MaRDI portal
Recommendations
Cites work
- A class of traceability codes
- Applications of list decoding to tracing traitors
- Combinatorial Properties for Traceability Codes Using Error Correcting Codes
- Combinatorial properties of frameproof and traceability codes
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 1406785 (Why is no real title available?)
- Identification of Traitors in Algebraic-Geometric Traceability Codes
- New results on frame-proof codes and traceability schemes
- On a class of traceability codes
- Tracing traitors
Cited in
(18)- Upper bounds for parent-identifying set systems
- Note on Niederreiter-Xing's propagation rule for linear codes
- Traceability codes
- A study of the separating property in Reed-Solomon codes by bounding the minimum distance
- Optimal 2-traceability codes of length 4
- A note on an upper bound of traceability codes
- scientific article; zbMATH DE number 2085429 (Why is no real title available?)
- Analysis of properties of q-ary Reed-Muller error-correcting codes viewed as codes for copyright protection
- Combinatorial Properties for Traceability Codes Using Error Correcting Codes
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- On the Properties of Algebraic Geometric Codes as Copy Protection Codes
- On traceability property of equidistant codes
- Comments on "New results on frame-proof codes and traceability schemes
- Information Security and Privacy
- On linear codes with random multiplier vectors and the maximum trace dimension property
- On some decision problems for trace codings
- Any lifting of a trace coding is a word coding
- Lemmas on traceability codes and an upper bound for 4-traceability
This page was built for publication: A Note About the Traceability Properties of Linear Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385526)