B. Bagchi and S. P. Inamdar, Projective Geometric Codes, Journal of Combinatorial Theory, Series A, vol.99, issue.1, pp.128-142, 2002.
DOI : 10.1006/jcta.2002.3265

URL : http://doi.org/10.1006/jcta.2002.3265

S. Ball, A. Blokhuis, and F. Mazzocca, Maximal arcs in Desarguesian planes of odd order do not exist, Combinatorica, vol.1, issue.1, pp.31-41, 1997.
DOI : 10.1007/BF01196129

C. Castleberry, K. Hunsberger, and K. E. Mellinger, LDPC codes arising from hyperovals, Bull. Inst. Comb. Appl, vol.58, pp.59-72, 2010.

D. Clark, D. Boeck, M. Fujiwara, Y. Tonchev, V. D. Vandendriessche et al., Entanglement-assisted quantum low-density parity-check codes, Phys. Rev. A, vol.82, p.42338, 2010.

R. H. Denniston, Some maximal arcs in finite projective planes, Journal of Combinatorial Theory, vol.6, issue.3, pp.317-319, 1969.
DOI : 10.1016/S0021-9800(69)80095-5

I. B. Djordjevic and B. V. Vasic, Projective geometry LDPC codes for ultralong-haul WDM high-speed transmission, IEEE Photonics Technology Letters, vol.15, issue.5, pp.784-786, 2003.
DOI : 10.1109/LPT.2003.810250

I. B. Djordjevic, S. Sankaranarayanan, and B. V. Vasic, Projective-Plane Iteratively Decodable Block Codes for WDM High-Speed Long-Haul Transmission Systems, Journal of Lightwave Technology, vol.22, issue.3, pp.695-702, 2004.
DOI : 10.1109/JLT.2004.825768

A. Gács and Z. Weiner, On (q + t, t)-arcs of type, Des. Codes Cryptogr, vol.2, issue.29, pp.131-139, 2003.

R. G. Gallager, Low-density parity-check codes, IEEE Transactions on Information Theory, vol.8, issue.1, pp.21-28, 1962.
DOI : 10.1109/TIT.1962.1057683

J. W. Hirschfeld and J. A. Thas, General Galois Geometries, 1991.
DOI : 10.1007/978-1-4471-6790-7

X. Hu, M. P. Fossorier, and E. Eleftheriou, On the computation of the minimum distance of low-density parity-check codes, Proc. IEEE Intl. Conf. Commun. (ICC), pp.767-771, 2004.

S. J. Johnson and S. R. Weller, Codes for Iterative Decoding From Partial Geometries, IEEE Transactions on Communications, vol.52, issue.2, pp.236-243, 2004.
DOI : 10.1109/TCOMM.2003.822737

J. Kim, K. E. Mellinger, and L. Storme, Small weight codewords in LDPC codes defined by (dual) classical generalized quadrangles, Designs, Codes and Cryptography, vol.14, issue.5, pp.73-92, 2007.
DOI : 10.1007/s10623-006-9017-6

G. Korchmáros and F. Mazzocca, On ( q + t)-arcs of type (0, 2, t) in a desarguesian plane of order q, Mathematical Proceedings of the Cambridge Philosophical Society, vol.9, issue.03, pp.445-459, 1990.
DOI : 10.1007/BF01225209

Y. Kou, S. Lin, and M. P. Fossorier, Low-density parity-check codes based on finite geometries: a rediscovery and new results, IEEE Transactions on Information Theory, vol.47, issue.7, pp.2711-2736, 2001.
DOI : 10.1109/18.959255

X. Li, C. Zhang, and J. Shen, Regular LDPC Codes from Semipartial Geometries, Acta Applicandae Mathematicae, vol.45, issue.5, pp.25-35, 2008.
DOI : 10.1007/s10440-007-9186-y

Z. Liu and D. A. Pados, LDPC Codes From Generalized Polygons, IEEE Transactions on Information Theory, vol.51, issue.11, pp.3890-3898, 2005.
DOI : 10.1109/TIT.2005.856936

D. J. Mackay and R. M. Neal, Near Shannon limit performance of low density parity check codes, Electronics Letters, vol.32, issue.18, pp.1645-1646, 1996.
DOI : 10.1049/el:19961141

R. Mathon, New Maximal Arcs in Desarguesian Planes, Journal of Combinatorial Theory, Series A, vol.97, issue.2, pp.353-368, 2002.
DOI : 10.1006/jcta.2001.3218

T. M. Ngatched, F. Takawira, and M. Bossert, An improved decoding algorithm for finite-geometry LDPC codes, IEEE Transactions on Communications, vol.57, issue.2, pp.302-306, 2009.
DOI : 10.1109/TCOMM.2009.02.060352

V. Pepe, L. Storme, and G. Van-de-voorde, Small weight codewords in the LDPC codes arising from linear representations of geometries, Journal of Combinatorial Designs, vol.14, issue.5, pp.1-24, 2009.
DOI : 10.1002/jcd.20179

K. J. Smith, On the p-rank of the incidence matrix of points and hyperplanes in a finite projective geometry, Journal of Combinatorial Theory, vol.7, issue.2, pp.122-129, 1969.
DOI : 10.1016/S0021-9800(69)80046-3

P. Vandendriessche, Some low-density parity-check codes derived from finite geometries, Designs, Codes and Cryptography, vol.50, issue.2, pp.287-297, 2010.
DOI : 10.1007/s10623-009-9324-9

P. Vandendriessche, LDPC codes associated with linear representations of geometries, Advances in Mathematics of Communications, vol.4, issue.3, pp.405-417, 2010.
DOI : 10.3934/amc.2010.4.405

P. Vandendriessche, Codes of Desarguesian projective planes of even order, projective triads and (q + t, t)-arcs of type

A. Vardy, The intractability of computing the minimum distance of a code, IEEE Transactions on Information Theory, vol.43, issue.6, pp.1757-1766, 1997.
DOI : 10.1109/18.641542