New results on frame-proof codes and traceability schemes

  • Authors:
  • R. Safavi-Naini;Y. Wang

  • Affiliations:
  • Sch. of Inf. Technol. & Comput. Sci., Wollongong Univ., NSW;-

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2006

Quantified Score

Hi-index 754.90

Visualization

Abstract

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