F. Ed, J. D. Assmus, and . Key, Polynomial codes and finite geometries, Handbook of coding theory, 1998.

C. Berrou, Codes et turbocodes. Collection IRIS, 2007.
DOI : 10.1002/9780470612422.ch5

P. Gaborit and G. Zémor, Asymptotic Improvement of the Gilbert–Varshamov Bound for Linear Codes, IEEE Transactions on Information Theory, vol.54, issue.9, pp.3865-3872, 2008.
DOI : 10.1109/TIT.2008.928288

V. Guruswami, Algorithmic Results in List Decoding, Foundations and Trends?? in Theoretical Computer Science, vol.2, issue.2, 2007.
DOI : 10.1561/0400000007

V. Guruswami and A. C. Patthak, Correlated algebraicgeometric codes : Improved list decoding over bounded alphabets, Mathematics of computation, 2007.
DOI : 10.1090/s0025-5718-07-02012-1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.307.2304

J. Hirschfeld, Projective Geometries over Finite Fields, 1998.

T. Jiang and A. Vardy, Asymptotic Improvement of the Gilbert???Varshamov Bound on the Size of Binary Codes, IEEE Transactions on Information Theory, vol.50, issue.8, pp.1655-1664, 2004.
DOI : 10.1109/TIT.2004.831751

R. Roth, Introduction to Coding Theory, 2006.
DOI : 10.1017/CBO9780511808968

S. Vladut, D. Nogin, and M. Tsfasman, Algebraic Geometric Codes : Basic Notions, 2007.