A note on an upper bound of traceability codes

MaRDI QIDQ2947388zbMATH OpenFDO

Authors

Publication date 23 September 2015

Full work available at URL http://ajc.maths.uq.edu.au//pdf/62/ajc_v62_p140.pdf

zbMATH Keywords

upper bound2-traceability codes of length 4

Mathematics Subject Classification ID

Combinatorial codes (94B25) Bounds on codes (94B65)

Recommendations

• Traceability codes
• New upper bounds for parent-identifying codes and traceability codes
• On a class of traceability codes
• A Note About the Traceability Properties of Linear Codes
• Combinatorial Properties for Traceability Codes Using Error Correcting Codes

Cited in

(10)

• Combinatorial Properties for Traceability Codes Using Error Correcting Codes
• New upper bounds for parent-identifying codes and traceability codes
• scientific article; zbMATH DE number 6534450 (Why is no real title available?)
• Comments on "New results on frame-proof codes and traceability schemes
• A New Upper Bound for the Dimension of Trace Codes
• Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
• Traceability codes
• Optimal 2-traceability codes of length 4
• On some decision problems for trace codings
• Any lifting of a trace coding is a word coding

This page was built for publication: A note on an upper bound of traceability codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947388)