Comment on "New Results on Frame-Proof Codes and Traceability Schemes"
Jan-{\AA}ke Larsson, Jacob Lofvenberg
TL;DR
This paper critically examines previous claims on bounds and existence of binary frame-proof codes and traceability schemes, revealing inaccuracies in the main results of the referenced work.
Contribution
It identifies errors in earlier proofs and results regarding bounds and constructions of frame-proof codes and traceability schemes.
Findings
Main results in the referenced paper do not hold.
Existence proofs and bounds need revision.
Previous claims about code constructions are invalid.
Abstract
In the paper "New Results on Frame-Proof Codes and Traceability Schemes" by Reihaneh Safavi-Naini and Yejing Wang [IEEE Trans. Inform. Theory, vol. 47, no. 7, pp. 3029-3033, Nov. 2001], there are lower bounds for the maximal number of codewords in binary frame-proof codes and decoders in traceability schemes. There are also existence proofs using a construction of binary frame-proof codes and traceability schemes. Here it is found that the main results in the referenced paper do not hold.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.