Skip to main content
Article
New results on frame-proof codes and traceability schemes
Faculty of Informatics - Papers (Archive)
  • R. Safavi-Naini, University of Wollongong
  • Yejing Wang, University of Wollongong
RIS ID
6376
Publication Date
1-11-2001
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.
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.

Citation Information
R. Safavi-Naini and Yejing Wang. "New results on frame-proof codes and traceability schemes" (2001)
Available at: http://works.bepress.com/rsafavinaini/13/