Construction of low-density parity-check codes based on balanced incomplete block designs

IEEE Transactions on Information Theory

Volumn 50, Issue 6, 2004, Pages 1257-1268

  Ammar, Bassem ^a   Honary, Bahram ^a   Kou, Yu ^b   Xu, Jun ^c   Lin, Shu ^d  

^a LANCASTER UNIVERSITY   (United Kingdom)

^b MARVELL SEMICONDUCTOR INC   (United States)

^c UNIVERSITY OF NOTRE DAME   (United States)

^d University of California   (United States)

Author keywords

Balanced incomplete block design; Quasic cyclic code; Symmetrically repeated difference

Indexed keywords

BLOCK CODES; DECODING; GRAPH THEORY; MATRIX ALGEBRA; SHIFT REGISTERS;

INCOMPLETE BLOCK DESIGNS; ITERATIVE DECODING; LOW DENSITY PARITY CHECK CODE; QUASIC CYCLIC CODE; SYMMETRICALLY DIFFERENCE;

SIGNAL ENCODING;

EID: 2942661950     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.828144     Document Type: Letter

References (46)

1. R. G. Gallager, "Low density parity check codes," IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
2. 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, 1996.
3. M. Sipser and D. Spielman, "Expander codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1710-1722, Nov. 1996.
4. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-432, Mar. 1999.
5. T. J. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.
6. T. J. Richardson, M. A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001.
7. S. Y. Chung, G. D. Forney Jr, T. Richardson, and R. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit," IEEE Commun. Lett., vol. 5, Feb. 2001.
8. 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.
9. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
10. N. Wiberg, H.-A. Loeliger, and R. Kötter, "Codes and iterative decoding on general graphs," Europ. Trans. Telecomm., vol. 6, pp. 513-526, Sept.-Oct. 1995.
11. R. J. McEliece, D. J. C. MacKay, and J.-F. Cheng, "Turbo decoding as an instance of Pearl's belief propagation algorithm," IEEE J. Select. Areas Commun., vol. 16, pp. 140-152, Feb. 1998.
12. F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, vol. 47, pp. 498-519, Feb. 2001.
13. 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.
14. 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.
15. M. Chiani and A. Ventura, "Design and performance evaluation of some high-rate irregular low-density parity-check codes," in Proc. 2001 IEEE GLOBECOM Conf., Nov. 2001, pp. 990-994.
16. M. Yang, W. E. Ryan, and Y. Li, "Design of efficient encodable moderate-length high-rate irregular LDPC codes," IEEE Trans. Commun., vol. 52, pp. 564-571, Apr. 2004.
17. J. Ha, J. Kim, and S. W. McLaughlim, "Rate-compatible puncturing of low-density parity-check codes," in Proc. 2001 IEEE Int. Symp. Information Theory, Yokohama, Japan, June/July 2003.
18. R. M. Tanner, "Spectral graphs for quasi-cyclic codes," in Proc. 2001 Int. Symp. Information Theory, Washington, DC, June 2001, p. 226.
19. P. O. Vontobel and R. M. Tanner, "Construction of codes based on finite generalized quadrangles for iterative decoding," in Proc. 2001 IEEE Int. Symp. Information Theory, Washington, DC, June 2001, p. 223.
20. J. Rosenthal and P. O. Vontobel, "Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from margulis," in Proc. 2001 IEEE Int. Symp. Information Theory, Washington, DC, June 2001, p. 4.
21. R. M. Tanner, D. Sridhara, and T. Fuja, "A class of group-structured LDPC copdes," in Proc., 6th Int. Symp. Communications Theory and Applications, Ambleside, U.K., July 2001, pp. 365-370.
22. H. Tang, Y. Kou, J. Xu, S. Lin, and K. Abdel-Ghaffar, "Codes on finite geometries: Old, new, majority-logic and iterative decodings," in Proc. 6th Int. Symp. Communications Theory and Applications, Ambleside, U.K., July 2001, pp. 381-386.
23. H. Tang, J. Xu, S. Lin, and K. Abdel-Ghaffar, "Codes on finite geometries," in Proc. 2001 IEEE Information Theory Workshop, Cairns, Australia, Sept. 2001, pp. 14-16.
24. S. Johnson and S. R. Weller, "Regular low-density parity-check codes from combinatorial designs," in Proc. 2001 IEEE Information Theory Workshop, Cairns, Australia, Sept. 2001, pp. 90-92.
25. Y. Kou, J. Xu, H. Tang, S. Lin, and K. Abdel-Ghaffar, "On circulant low density parity check codes," in Proc. 2002 IEEE Int. Symp. Information Theory, Lausanne, Switzerland, June/July 2002, p. 200.
26. H. Tang, J. Xu, Y. Kou, S. Lin, and K. Abdel-Ghaffar, "On algebraic construction of Gallager low-density parity-check codes," in Proc. 2002 IEEE Int. Symp. on Inform. Theory, Lausanne, Switzerland, June-July 30-5, 2002, p. 482.
27. B. Basic, "Combinatorial constructions of low-density parity-check codes for iterative decoding," IEEE Trans. Inform. Theory, vol. 50, pp. 1156-1176, June 2004.
28. B. Ammar, B. Honary, Y. Kou, and S. Lin, "Construction of low density parity check codes: A combinatoric design approach," in Proc. 2002 IEEE Int. Symp. Information Theory, Lausanne, Switzerland, June/July 2002, p. 311.
29. S. J. Johnson and S. R. Weller, "Codes for iterative decoding from partial geometries," in Proc. 2002 IEEE Int. Symp. Information Theory, Lausanne, Switzerland, June/July 2002, p. 310.
30. ____, "A family of irregular LDPC codes with low encoding complexity," IEEE Commun. Lett., vol. 7, pp. 79-81, Feb. 2003.
31. I. Djurdjevic, J. Xu, K. Abdel-Ghaffar, and S. Lin, "Construction of low-density parity-check codes based on Reed-Solomon codes with two information symbols," IEEE Commun. Lett., vol. 7, pp. 317-319, July 2003.
32. M. Fossorier, "Quasicyclic low density parity check codes," in Proc. 2003 IEEE Int. Symp. Information Theory, Yokohama, Japan, June/July 2003, p. 150.
33. T. Okamura, "Designing LDPC codes using cyclic shifts," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, June/July 2003, p. 151.
34. S. Lin, J. Xu, I. Djurdjevic, and H. Tang, "Hybrid construction of LDPC codes," in Proc. 40th Annu. Allerton Conf. Communication, Control, and Computing, Monticello, IL, Oct. 2002.
35. J. Xu, L. Chen, H. Tang, L. Q. Zeng, and S. Lin, "Construction of low-density parity-check codes by superposition," IEEE Trans. Commun., submitted for publication.
36. S. Lin, L. Chen, J. Xu, and I. Djurdjevic, "Near Shannon limit quasicyclic low-density parity-check codes," in Proc. 2003 IEEE GLOBECOM Conf., San Francisco, CA, Dec. 2003.
37. H. Tang, J. Xu, Y. Kou, S. Lin, and K. Abdel-Ghaffar, "On algebraic construction of Gallager and circulant low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 50, pp. 1269-1279, June 2004.
38. Z. W. Li, L. Chen, and S. Lin, "Efficient encoding of quasicyclic low density parity check codes," IEEE Trans. Commun., submitted for publication.
39. R. C. Bose, "On the construction of balanced incomplete block designs," Ann. Eugenics 9, pp. 353-399, 1939.
40. H. B. Mann, Analysis and Design of Experiments. New York: Dover, 1949.
41. A. P. Street and D. J. Street, Combinatoric of Experimental Design. Oxford, U. K.: Oxford Science/Clarendon, 1987.
42. C. J. Colbourn and H. J. Dinitz, The CRC Handbook of Combinatorial Designs. Boca Raton, Fl: CRC, 1996.
43. I. F. Blake and R. Mullin, The Mathematical Theory of Coding. New York: Academic, 1975.
44. N. Hamada, "On the p-rank of the incidence matrix of a balance or partial balanced incomplete block designs and its application to error correcting codes," J. Hiroshima Math., no. 3, pp. 153-226, 1973.
45. J. E. M. Nilsson and R. Kötter, "Iterative decoding of product code construction," in Proc. Int. Symp. Information Theory and Its Applications, Sydney, Australia, Nov. 1994, pp. 1059-1064.
46. R. Kötter and J. E. M. Nilsson, "Interleaving strategies for product codes," in Proc. EIDMA Winter Meet. on Coding Theory and Cryptology, Veldhoven, The Netherlands, Dec. 1994.