Combinatorial Properties for Traceability Codes Using Error Correcting Codes

DOI10.1109/TIT.2006.889730MaRDI QIDQ3548833zbMATH OpenOpenAlexFDO

Authors Hongxia Jin, Mario Blaum

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tit.2006.889730

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• Combinatorial properties of frameproof and traceability codes
• Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
• On the relationship between the traceability properties of Reed-Solomon codes
• A note on an upper bound of traceability codes
• A Note About the Traceability Properties of Linear Codes
• On traceability property of equidistant codes
• scientific article; zbMATH DE number 4059292
• On a class of traceability codes
• Error-correcting codes based on partial maps in finite sets.
• Combinatorial properties of quasi-composition of codes

Cited in

(10)

• A study of the separating property in Reed-Solomon codes by bounding the minimum distance
• Combinatorial properties of frameproof and traceability codes
• A note on an upper bound of traceability codes
• Analysis of properties of q-ary Reed-Muller error-correcting codes viewed as codes for copyright protection
• A Note About the Traceability Properties of Linear Codes
• Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
• On a class of traceability codes
• On traceability property of equidistant codes
• Traceability codes
• Optimal 2-traceability codes of length 4

This page was built for publication: Combinatorial Properties for Traceability Codes Using Error Correcting Codes

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