Comment on "New Results on Frame-Proof Codes and Traceability Schemes"
Information Theory
2022-03-16 v1 math.IT
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.
Keywords
Cite
@article{arxiv.0912.1440,
title = {Comment on "New Results on Frame-Proof Codes and Traceability Schemes"},
author = {Jan-Åke Larsson and Jacob Lofvenberg},
journal= {arXiv preprint arXiv:0912.1440},
year = {2022}
}
Comments
3 pages