Lemmas on traceability codes and an upper bound for 4-traceability

DOI10.1007/S10623-025-01748-ZMaRDI QIDQ6879001zbMATH OpenFDO

Authors Huilan Chang, Ching-Chih Hsu

Publication date 5 January 2026

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10623-025-01748-Z

zbMATH Keywords

traceability codestracing traitors

Mathematics Subject Classification ID

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

Cites work

• A Note About the Traceability Properties of Linear Codes
• Combinatorial Properties for Traceability Codes Using Error Correcting Codes
• Combinatorial properties of frameproof and traceability codes
• scientific article; zbMATH DE number 1996248 (Why is no real title available?)
• scientific article; zbMATH DE number 1406785 (Why is no real title available?)
• New upper bounds for parent-identifying codes and traceability codes
• On a class of traceability codes
• Optimal 2-traceability codes of length 4
• Traceability codes
• Traceability codes and their generalizations
• Tracing traitors

This page was built for publication: Lemmas on traceability codes and an upper bound for 4-traceability

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