LDPC codes from generalized polygons

IEEE Transactions on Information Theory

Volumn 51, Issue 11, 2005, Pages 3890-3898

  Liu, Zhenyu ^a,b   Pados, Dimitris A ^a  

^a the State University of New York   (United States)

^b MARVELL SEMICONDUCTOR INC   (United States)

Author keywords

Belief propagation; Cyclic codes; Generalized polygons; Low density parity check (LDPC) codes; Sum product algorithm

Indexed keywords

BIT ERROR RATE; BLOCK CODES; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DECODING; GRAPH THEORY; MATRIX ALGEBRA;

BELIEF PROPAGATION; CYCLIC CODES; GENERALIZED POLYGONS; LOW-DENSITY PARITY-CHECK (LDPC) CODES; SUM-PRODUCT ALGORITHM;

ENCODING (SYMBOLS);

EID: 27744563534     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2005.856936     Document Type: Article

References (27)

1. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inf. Theory, vol. IT-8, no. 1, pp. 21-28, Jan. 1962.
2. R. G. Gallager,, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
3. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low-density parity-check codes," Electron. Lett., vol. 32, pp. 1645-1646, Aug. 1996.
4. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619--637, Feb. 2001.
5. Y. Kou, S. Lin, and M. P. C. Fossorier, "Low-density parity-check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inf. Theory, vol. 47, no. 7, pp. 2711-2736, Nov. 2001.
6. G. A. Margulis, "Explicit constructions of graphs without short cycles and low-density codes," Combinatorica, vol. 2, pp. 71-78, 1982.
7. S. J. Johnson and S. R. Weller, "Resolvable 2-designs for regular low-density parity-check codes," IEEE Trans. Commun., vol. 51, no. 9, pp. 1413-1419, Sep. 2003.
8. B. Vasic and O. Milenkovic, "Combinatorial constructions of low-density parity-check codes for iterative decoding," IEEE Trans. Inf. Theory, vol. 50, no. 5, pp. 1156-1176, Jun. 2004.
9. J.-L. Kim, U. N. Pelde, I. Perepelitsa, V. Pless, and S. Friedland, "Explicit construction of families of LDPC codes with no 4-cycles," IEEE Trans. Inf. Theory, vol. 50, no. 10, pp. 2378-2388, Oct. 2004.
10. X.-Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386-398, Jan. 2005.
11. H. Xiao and A. H. Banihashemi, "Improved progressive-edge-growth (PEG) construction of irregular LDPC codes," IEEE Commun. Lett., vol. 8, no. 12, pp. 715-717, Dec. 2004.
12. J. Tits, "Sur la Trialité et Certains Groupes qui s'en Déduisent," Inst. Hautes Etudes Sci. Publ. Math., vol. 2, pp. 14-60, 1959.
13. W. Feit and G. Higman, "The nonexistence of certain generalized polygons," J. Algebra, vol. 1, pp. 114-131, 1964.
14. P. O. Vontobel and R. M. Tanner, "Construction of codes based on finite generalized quadrangles for iterative decoding," in Proc. IEEE Int. Symp. Information Theory, Washington, DC, Jun. 2001, p. 223.
15. H. van Maldeghem, Generalized Polygons. Basel, Switzerland: Birkhäuser-Verlag, 1998.
16. B. Bagchi and N. S. N. Sastry, "Codes associated with generalized polygons," Geom. Dedicata, vol. 27, pp. 1-8, 1988.
17. B. Huppert, "Singer-Zyklen in klassischen Gruppen," Math. Z., vol. 117, pp. 141-150, 1970.
18. J. Chen and M. P. C. Fossorier, "Near optimum universal belief propagation based decoding of low-density parity check codes," IEEE Trans. Commun., vol. 50, no. 3, pp. 406-414, Mar. 2002.
19. B. Bagchi and N. S. N. Sastry, "Even order inversive planes, generalized quadrangles and codes," Geom. Dedicata, vol. 22, pp. 137-147, 1987.
20. B. Bagchi, A. E. Brouwer, and H. A. Wilbrink, "Notes on binary codes related to the O(5, q) generalized quadrangle for odd q" Geom. Dedicata, vol. 39, pp. 339-355, 1991.
21. R. M. Tanner, "A recursive approach to low-complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, no. 6, pp. 533-547, Nov. 1981.
22. R. M. Tanner, "Minimum-distance bounds by graph analysis," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 808-821, Feb. 2001.
23. X.-Y. Hu and M. P. C. Fossorier. On the computation of the minimum distance of low-density parity-check codes. [Online]. Available: http://www.inference.phy.cam.ac.uk/mackay/codes/MINDIST/main.pdf
24. P. O. Vontobel, "Algebraic coding for iterative decoding," Ph.D. dissertation, Swiss Federal Inst. Technol., Zurich, Switzerland, 2003.
25. R. M. Tanner, "A transform theory for a class of group-invariant codes," IEEE Trans. Inf. Theory, vol. 34, no. 4, pp. 752-775, Jul. 1988.
26. LDPCopt, An Efficient Optimization Program for LDPC Codes [Online]. Available: http://lthcwww.epfl.ch/research/ldpcopt/
27. X.-Y. Hu, E. Eleftheriou, and D. M. Arnold. Source code for progressive edge growth parity-check matrix construction. [Online]. Available: http://www.inference.phy.cam.ac.uk/mackay/codes/PEG/PEG.tar.gz