对“防帧码和可追踪方案的新结果”的评论
Comment on "New Results on Frame-Proof Codes and Traceability Schemes"
摘要：
在Reihaneh Safavi-Naini和Yejing Wang的论文“New Results on Frame-Proof Codes and Traceability Schemes”[IEEE Trans. Inform. Theory，vol. 47，no. 7，pp. 3029-3033，2001年11月]，在可追踪性方案中，二进制防帧码和解码器中的码字的最大数目存在下界。也有使用二进制框架证明码和可追溯性计划的建设存在性证明。在这里，它被发现，在参考文件中的主要结果不成立。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
