Comments on "New results on frame-proof codes and traceability schemes
From MaRDI portal
Publication:5281241
DOI10.1109/TIT.2010.2070632zbMATH Open1366.94762OpenAlexW2097109453MaRDI QIDQ5281241FDOQ5281241
Authors: J. Löfvenberg, Jan-Åke Larsson
Publication date: 27 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2010.2070632
Recommendations
- New results on frame-proof codes and traceability schemes
- Combinatorial Properties and Constructions of Traceability Schemes and Frameproof Codes
- Combinatorial properties of frameproof and traceability codes
- New Bounds for Frameproof Codes
- Several new frameproof codes and secure frameproof codes
- A note on an upper bound of traceability codes
- A Note About the Traceability Properties of Linear Codes
- On tight bounds for binary frameproof codes
- Constructions of almost secure frameproof codes with applications to fingerprinting schemes
- Asymptotic bounds on frameproof codes
Cited In (2)
This page was built for publication: Comments on "New results on frame-proof codes and traceability schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5281241)