Optimal 2-traceability codes of length 4

DOI10.1016/j.tcs.2023.113800OpenAlexW4323349967MaRDI QIDQ2697541

Geng-Yu Chen, Hong-Bin Chen

Publication date: 12 April 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113800

zbMATH Keywords

traceability

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• I.P.P.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On codes with the identifiable parent property
• On a class of traceability codes
• New upper bounds for parent-identifying codes and traceability codes
• A class of I.P.P. codes with efficient identification
• An upper bound on the size of a code with the \(k\)-identifiable parent property
• Traceability codes
• Traceability codes and their generalizations
• Codes for copyright protection: the case of two pirates
• Combinatorial Properties for Traceability Codes Using Error Correcting Codes
• Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
• Frameproof Codes
• Combinatorial properties of frameproof and traceability codes
• Tracing traitors
• New Bounds on Parent-Identifying Codes: The Case of Multiple Parents
• A class of traceability codes
• Digital fingerprinting codes: problem statements, constructions, identification of traitors
• Applications of list decoding to tracing traitors
• A Note About the Traceability Properties of Linear Codes
• Parent-identifying codes

This page was built for publication: Optimal 2-traceability codes of length 4