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

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

2009-12-08

arxiv.org/abs/0912.1440v1

IEEE Transactions on Information Theory, 56(11): 5888-5889, 2010

Computer Science

Information Theory

3 pages

Scientific paper

10.1109/TIT.2010.2070632

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.

Affiliated with

Also associated with

No associations

Rating

Comment on "New Results on Frame-Proof Codes and Traceability Schemes" does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Comment on "New Results on Frame-Proof Codes and Traceability Schemes", we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Comment on "New Results on Frame-Proof Codes and Traceability Schemes" will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-385608