Quasi-cyclic low-density parity-check codes from circulant permutation matrices

IEEE Transactions on Information Theory

Volumn 50, Issue 8, 2004, Pages 1788-1793

  Fossorier, Marc P C ^a  

^a IEEE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DECODING; GRAPH THEORY; ITERATIVE METHODS; MATRIX ALGEBRA; THEOREM PROVING;

ITERATIVE DECODING; LOW DENSITY PARITY CHECK CODES; QUASI CYCLIC CODES; TANNER GRAPH;

CODES (SYMBOLS);

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

References (26)

1. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, Mar. 1999.
2. T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, "Design of capacity-approaching irregular low-density parity check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001.
3. M. G. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. A. Spielman, "Improved low-density parity check codes using irregular graphs," IEEE Trans. Inform. Theory, vol. 47, pp. 585-598, Feb. 2001.
4. S. Y. Chung, G. D. Forney, T. J. Richardson, and R. L. Urbanke, "On the design of low-density parity check codes within 0.0045 dB of the Shannon limit," IEEE Commun. Lett., vol. 5, pp. 58-60, Feb. 2001.
5. X.-Y. Hu, "Low-delay low-complexity error correcting codes on sparse graphs," Doctoral dissertation, Swiss Federal Institute of Technology Lausanne (EPFL), Lausanne, Switzerland, 2002.
6. X.-Y. Hu, E. Eleftheriou, and D.-M. Arnold, "Irregular progressive-edge growth (PEG) Tanner graphs," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, July 2002, p. 480.
7. P. O. Vontobel and H. A. Loeliger, "Irregular codes from regular graphs," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, July 2002, p. 284.
8. R. Lucas, M. Fossorier, Y. Kou, and S. Lin, "Iterative decoding of one-step majority logic decodable codes based on belief propagation," IEEE Trans. Commun., vol. 48, pp. 931-937, June 2000.
9. Y. Kou, S. Lin, and M. Fossorier, "Low-density parity-check codes based on finite geometries: A Rediscovery and new results," IEEE Trans. Inform. Theory, vol. 47, pp. 2711-2736, Nov. 2001.
10. 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, June 2001, p. 223.
11. S. J. Johnson and S. R. Weller, "Codes for iterative decoding from partial geometries," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, July 2002, p. 310.
12. J. L. Kim, U. N. Peled, I. Perepelitsa, and V. Pless, "Explicit construction of families of LDPC codes with girth at least six," in Proc. 40th Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, 2002.
13. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT. Press, 1963.
14. R. Townsend and E. J. Weldon, "Self orthogonal quasicyclic codes," IEEE Trans. Inform. Theory, vol. IT-13, pp. 183-195, Mar. 1967.
15. J. L. Fan, "Array codes as low-density parity-check codes," in Proc. 2nd Int. Symp. Turbo Codes, Brest, France, Sept. 2000, pp. 545-546.
16. R. M. Tanner, D. Sridhara, and T. Fuja, "A class of group-structured LDPC codes," in Proc. ISTA, Ambleside, England, 2001.
17. B. Vasic, "Combinatorial constructions of low-density parity check codes for iterative decoding," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, July 2002, p. 312.
18. T. Mittleholzer, "Efficient encoding and minimum distance bounds of Reed-Solomon-type array codes," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, July 2002, p. 282.
19. I. Djurdjevic, J. Xu, K. Abdel-Ghaffar, and S. Lin, "A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols," IEEE Commun. Lett., vol. 7, pp. 317-319, July 2003.
20. T. Okamura, "Designing LDPC codes using cyclic shifts," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, June/July 2003, p. 151.
21. J. Denes and A. D. Keedwell, Latin Squares and their Applications. New York: Academic Press, 1974.
22. W. W. Peterson and E. J. Weldon Jr, Error-Correcting Codes, 2nd ed. Cambridge, MA: MIT Press, 1972.
23. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
24. N. Kamiya, "Recent results on the girth of a block matrix consisting of permutations," Mitsubishi, Kanagawa, Japan, Tech. Rep., 2003.
25. D. J. C. MacKay and M. Davey, "Evaluation of Gallager codes for short block length and high rate applications," in Proc. IMA Workshop Codes, Systems and Graphical Models, 1999.
26. D. J. C. MacKay and M. S. Postol, "Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check codes," Electron. Notes in Theor. Comput. Sci., vol. 74, 2003.