Capacity and random-coding error exponent for public fingerprinting game

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2006, Pages 1174-1178

  Wang, Ying ^a   Moulin, Pierre ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GEL'FAND-PINSKER TECHNIQUE; PUBLIC FINGERPRINTING GAME; RANDOM-CODING ERROR EXPONENT; STACKED BINNING SCHEME;

DECODING; ERROR ANALYSIS; RANDOM PROCESSES; SIGNAL ENCODING;

CHANNEL CAPACITY;

EID: 39049134843     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2006.261990     Document Type: Conference Paper

References (5)

1. A. Somekh-Baruch and N. Merhav, "On the capacity game of private fingerprinting systems under collusion attacks," IEEE Trans. Inform. Theory, vol. 51, no. 3, pp. 884-899, Mar. 2005.
2. A. Somekh-Baruch and N. Merhav, "Achievable error exponents for the private fingerprinting game," submitted to IEEE Trans. Inform. Theory, Feb. 2005.
3. P. Moulin and Y. Wang, "Error exponents for channel coding with side information," preprint, available from cs.arxiv.org, Sept. 2004.
4. S. I. Gel'fand and M. S. Pinsker, "Coding for channel with random parameters," Prob. of Control and Inform. Theroy, vol. 9, no. 1, pp. 19-31, 1980.
5. A. Somekh-Baruch and N. Merhav, "On the random coding error exponents of the single-user and the multiple-acess Gel'fand-Pinsker channels," Proc. IEEE Int. Symp. Info. Theory, p. 448, Chicago, IL, Jul. 2004.