Regular LDPC Codes from Semipartial Geometries

By considering a class of combinatorial structures, known as semipartial geometries, we define a class of low-density parity-check (LDPC) codes. We derive bounds on minimum distance, rank and girth for the codes from semipartial geometries, and present constructions and performance results for the classes of semipartial geometries which have not previously been proposed for use with iterative decoding.

[1]  J. Tits.  Ovoßdes et Groupes de Suzuki , 1962 .

[2]  Peter J. Cameron,et al.  Graphs, Codes, And Designs , 1980 .

[3]  Sarah J. Johnson,et al.  Regular low-density parity-check codes from oval designs , 2003, Eur. Trans. Telecommun..

[4]  Shu Lin,et al.  Iterative decoding of one-step majority logic deductible codes based on belief propagation , 2000, IEEE Trans. Commun..

[5]  Richard M. Wilson,et al.  A course in combinatorics , 1992 .

[6]  D. Mackay,et al.  Evaluation of Gallager Codes for Short Block Length and High Rate Applications , 2001 .

[7]  Some Applications of Magma in Designs and Codes: Oval Designs, Hermitian Unitals and Generalized Reed-Muller Codes , 2001, J. Symb. Comput..

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

[9]  Sarah J. Johnson,et al.  Codes for iterative decoding from partial geometries , 2004, IEEE Transactions on Communications.

[10]  Sarah J. Johnson,et al.  Regular low-density parity-check codes from combinatorial designs , 2001, Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494).

[11]  Joachim Rosenthal,et al.  Codes, systems, and graphical models , 2001 .

[12]  Joseph A. Thas.  Semi-Partial Geometries and Spreads of Classical Polar Spaces , 1983, J. Comb. Theory, Ser. A.

[13]  Sarah J. Johnson,et al.  Resolvable 2-designs for regular low-density parity-check codes , 2003, IEEE Trans. Commun..

[14]  Jennifer D. Key,et al.  Designs and their codes , 1992, Cambridge tracts in mathematics.

[15]  A. Brouwer,et al.  On the p-Rank of the Adjacency Matrices of Strongly Regular Graphs , 1992 .

[16]  Joseph A. Thas,et al.  On Semipartial Geometries , 1978, J. Comb. Theory, Ser. A.

[17]  R. C. Bose.  Strongly regular graphs, partial geometries and partially balanced designs. , 1963 .

[18]  Marshall Hall,et al.  Codes and Designs , 1981, J. Comb. Theory, Ser. A.

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

[20]  H. S. M. Coxeter.  Twelve points in PG(5, 3) with 95040 self-transformations , 1958, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[21]  Pascal O. Vontobel,et al.  Construction of codes based on finite generalized quadrangles for iterative decoding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[22]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[23]  Robert Michael Tanner,et al.  Minimum-distance bounds by graph analysis , 2001, IEEE Trans. Inf. Theory.