Random coding technique for digital fingerprinting codes: Fighting two pirates revisited

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2004, Pages 203-

  Blakley, G R ^a   Kabatiansky, G ^b  

^a TEXAS A AND M UNIVERSITY   (United States)

^b INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY MATRICES; FINGERPRINTING; MARKING ASSUMPTION;

BINARY CODES; ERROR ANALYSIS; MATRIX ALGEBRA; POLYNOMIALS; PROBABILITY; PROBLEM SOLVING; SET THEORY; VECTORS;

PATTERN RECOGNITION;

EID: 5044245035     PISSN: 21578097     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. D. Boneh and J. Shaw, "Collusion-secure fingerprinting for digital data," IEEE Trans. on Information Theory, vol. 44, pp. 1987-1905, 1998.
2. A. Barg, G. R. Blakley and G. Kabatiansky, "Digital finger-printing codes: Problem statements, constructions, identification of traitors," IEEE Trans. on Information Theory, vol. 49, pp. 852-865, 2003.
3. G. Tardos, "Optimal probabilistic fingerprinting codes" STOC'03, pp. 116-125, 2003.
4. H.G.Schaathun, "Fighting two pirates", AAECC 2003, Lecture Notes in Computer Science, vol. 2643, pp. 71-78, 2003.