LDPC codes from triangle-free line sets

Designs, Codes, and Cryptography

Volumn 32, Issue 1-3, 2004, Pages 341-350

  Mellinger, Keith E ^a  

^a UNIVERSITY OF MARY WASHINGTON   (United States)

Author keywords

Cap; Ldpc codes; Polarity

Indexed keywords

LDPC CODES; POLARITY; TANNER GRAPH;

ALGORITHMS; COMPUTATIONAL GEOMETRY; GRAPH THEORY; ITERATIVE METHODS; MATRIX ALGEBRA; SET THEORY;

CODES (SYMBOLS);

EID: 3543129446     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:DESI.0000029233.20866.41     Document Type: Conference Paper

References (10)

1. A. E. Brouwer, Bounds on the size of linear codes. In V. S. Pless and W. C. Huffman (eds), Handbook of Coding Theory, Elsevier (1998) pp. 295-452.
2. J. Cannon and C. Playoust, An Introduction to Magma, University of Sydney, Sydney, Australia (1994).
3. R. G. Gallager, Low density parity check codes, IRE Trans. Infom. Theory, Vol. IT-8 (1962) pp. 21-28.
4. J. W. P. Hirschfeld, Projecting Geometries over Finite Fields, second edition, Oxford University Press, Oxford, (1998).
5. J. W. P. Hirschfeld, Finite Projective Spaces of Three Dimensions, Oxford University Press, Oxford (1985).
6. J.-L. Kim, U. Peled, I. Perepelitsa and V. Pless, Explicit construction of families of LDPC codes with Girth at least six. In P. G. Voulgaris and R. Srikant (eds), Proceedings of the 40th Allerton Conference on Communication, Control and Computing, October 2-4, 2002, pp. 1024-1031.
7. Y. Kuo, S. Lin and M. P. C. Fossorier, Low-density parity-check codes based on finite geometries: A rediscovery and new results, IEEE Trans. Inform. Theory, Vol. 47, No. 7 (2001) pp. 2711-2736.
8. D. J. C. MacKay and R. M. Neal, Near Shannon limit performance of low density parity check codes, Electron. Lett., Vol. 32, No. 18 (1996) pp. 1645-1646.
9. B. Segre, Ovals in a finite protective plane, Canad. J. Math. Vol. 7 (1955) pp. 414-416.
10. R. M. Tanner, A recursive approach to low complexity codes, IEEE Trans. Inform. Theory, Vol. IT-27 (1981). pp. 533-547.