Comments on "new results on frame-proof codes and traceability schemes"

  • Authors:

  • Jacob Löfvenberg;Jan-Åke Larsson

  • Affiliations:

  • Swedish Defence Research Agency, Division of Information Systems, SE Linköping, Sweden and Department of Electrical Engineering, Linköping University, Linköping, Sweden;Department of Electrical Engineering, Linköping University, Linköping, Sweden and Department of Mathematics, Linköping University, Linköping, Sweden

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

Quantified Score

Hi-index 754.90

Visualization

Abstract

The paper "New Results on Frame-Proof Codes and Traceability Schemes" claims to give results for two code classes, frame-proof codes and traceability schemes, in the form of lower bounds on the maximum code size, and explicit code constructions. We will here briefly review the four claims of, noting that the proofs and constructions presented in fail, and that the claims also contradict previously published upper bounds.