Pith. sign in

REVIEW

Comment on "New Results on Frame-Proof Codes and Traceability Schemes"

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 0912.1440 v1 pith:7VD6UZ54 submitted 2009-12-08 cs.IT math.IT

Jan-{AA}ke Larsson , Jacob Lofvenberg This is my paper · ORCID
classification cs.ITmath.IT
keywords codesframe-proofschemestraceabilityresultsbinarytherebounds
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In the paper "New Results on Frame-Proof Codes and Traceability Schemes" by Reihaneh Safavi-Naini and Yejing Wang [IEEE Trans. Inform. Theory, vol. 47, no. 7, pp. 3029-3033, Nov. 2001], there are lower bounds for the maximal number of codewords in binary frame-proof codes and decoders in traceability schemes. There are also existence proofs using a construction of binary frame-proof codes and traceability schemes. Here it is found that the main results in the referenced paper do not hold.

Discussion (0). Continue with ORCID to comment.

Pith tools