论文信息 - Classes of codes from quadratic surfaces of PG(3, q)

Classes of codes from quadratic surfaces of PG(3, q)

We examine classes of binary linear error correcting codes constructed from certain sets of lines defined relative to one of the two classical quadratic surfaces in $PG(3,q)$. We give an overview of some of the properties of the codes, providing proofs where the results are new. In particular, we use geometric techniques to find small weight codewords, and hence, bound the minimum distance.

Keith E. Mellinger | K. E. Mellinger

[1] Mandy Passmore,et al. On codes generated from quadratic surfaces in PG(3,q) , 2004 .

[2] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.

[3] J. Hirschfeld. Projective Geometries Over Finite Fields , 1980 .

[4] J. Thas,et al. Finite Generalized Quadrangles , 2009 .

[5] P. Vontobel,et al. Constructions of LDPC Codes using Ramanujan Graphs and Ideas from Margulis , 2000 .

[6] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[7] 脇克志. An Introduction to MAGMA , 1995 .

[8] Andries E. Brouwer,et al. Some 2-ranks , 1992, Discret. Math..

[9] Jon-Lark Kim,et al. Explicit Construction of Families of LDPC Codes with Girth at Least Six , 2002 .

[10] Radford M. Neal,et al. Near Shannon limit performance of low density parity check codes , 1996 .

[11] Shu Lin,et al. Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.

[12] J. Hirschfeld. Finite projective spaces of three dimensions , 1986 .

[13] Keith E. Mellinger,et al. LDPC Codes from Triangle-Free Line Sets , 2004, Des. Codes Cryptogr..

[14] Sang Joon Kim,et al. A Mathematical Theory of Communication , 2006 .

[15] Daniel A. Spielman,et al. Expander codes , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.