Comments on "New results on frame-proof codes and traceability schemes
Jacob Löfvenberg, Jan-Åke Larsson · IEEE Transactions on Information Theory · 2010
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.