E. Amiri and G. Tardos, High rate fingerprinting codes and the fingerprinting capacity, Proc. of 20th Annual ACM-SIAM Symposium on Discrete Algorithms, 2009.
DOI : 10.1137/1.9781611973068.38

Y. Huang and P. Moulin, Saddle-point solution of the fingerprinting capacity game under the marking assumption, 2009 IEEE International Symposium on Information Theory, 2009.
DOI : 10.1109/ISIT.2009.5205882

D. Boneh and J. Shaw, Collusion-secure fingerprinting for digital data, IEEE Transactions on Information Theory, vol.44, issue.5, pp.1897-1905, 1998.
DOI : 10.1109/18.705568
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.31.6638

P. Moulin, Universal fingerprinting: Capacity and random-coding exponents, 2008 IEEE International Symposium on Information Theory, 2008.
DOI : 10.1109/ISIT.2008.4594980
URL : http://arxiv.org/abs/0801.3837

J. C. Sevy, Lagrange and Least-Squares Polynomials as Limits of Linear Combinations of Iterates of Bernstein and Durrmeyer Polynomials, Journal of Approximation Theory, vol.80, issue.2, pp.267-271, 1995.
DOI : 10.1006/jath.1995.1018

R. E. Blahut, Computation of channel capacity and rate-distortion functions, IEEE Transactions on Information Theory, vol.18, issue.4, pp.460-473, 1972.
DOI : 10.1109/TIT.1972.1054855

T. M. Cover and J. A. Thomas, Elements of Information Theory, 1991.

T. Furon and L. Pérez-freire, Worst case attacks against binary probabilistic traitor tracing codes, 2009 First IEEE International Workshop on Information Forensics and Security (WIFS), 2009.
DOI : 10.1109/WIFS.2009.5386484
URL : https://hal.archives-ouvertes.fr/inria-00505893

K. Nuida, An improvement of short 2-secure fingerprint codes strongly avoiding false-positive, " in to appear in proc, 2009.