RIS ID
6376
Abstract
In this correspondence we derive lower bounds on the maximum number of codewords in a class of frame-proof codes and traceability schemes, and give constructions for both with more codewords than the best known.
6376
In this correspondence we derive lower bounds on the maximum number of codewords in a class of frame-proof codes and traceability schemes, and give constructions for both with more codewords than the best known.
Publication Details
This article was originally published as: Safavi-Naini ,R & Wang, Y, New results on frame-proof codes and traceability schemes, IEEE Transactions on Information Theory, November 2001, 47(7) 3029-3033. Copyright IEEE 2001.