Combinatorial constructions of low-density parity-check codes for iterative decoding

IEEE Transactions on Information Theory

Volumn 50, Issue 6, 2004, Pages 1156-1176

  Vasic, Bane ^a   Milenkovic, Olgica ^b  

^a University of Arizona   (United States)

^b UCB 450   (United States)

Author keywords

Cyclic difference families; Iterative decoding; Low density parity check (LDPC) codes; Pasch configurations

Indexed keywords

BLOCK CODES; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATRIX ALGEBRA;

CODE DESIGN; CYCLIC DIFFERENCE FAMILIES; GALLAGER CODES; ITERATIVE DECODING; LOW DENSITY PARITY CHECK CODES; PASCH CONFIGURATION;

DECODING;

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

References (74)

1. D. J. C. MacKay and R. M. Neal, "Good codes based on very sparse matrices," in Cryptography and Coding, Proc. 5th IMA Conf. (Lecture Notes in Computer Science), C. Boyd, Ed. Berlin, Germany: Springer-Verlag, 1995, vol. 1025, pp. 110-111.
2. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
3. C. E. Shannon, "A mathematical theory of communication," Bell Syst. Tech. J., pp. 372-423, 1948.
4. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, Mar. 1999.
5. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-638, Feb. 2001.
6. B. J. Frey, Graphical Models for Machine Learning and Digital Communication. Cambridge, MA: MIT Press, 1998.
7. F. R. Kschischang and B. J. Frey, "Iterative decoding of compound codes by probability propagation in graphical models," IEEE J. Select. Areas Commun., vol. 16, pp. 219-230, Feb. 1998.
8. 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.
9. 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.
10. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
11. N. Wiberg, H.-A. Loeliger, and R. Kötter, "Codes and iterative decoding on general graphs," Eurp. Trans. Telecommun., vol. 6, pp. 513-525, Sept/Oct. 1995.
12. Y. Kou, S. Lin, and M. Fossorier, "Construction of low-density parity-check codes: A geometric approach," in Proc. 2nd Int. Symp. Turbo Codes, Brest, France, Sept. 4-7, 2000.
13. 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. Inform. Theory, vol. 47, pp. 2711-2736, Nov. 2001.
14. R. M. Tanner, D. Srkdhara, and T. Fuja. A class of group-structured LDPC codes. [Online] Available: http://www.cse.ucsc.edu/~tanner/pubs.html
15. J. Rosenthal and P. O. Vontobel, "Construction of LDPC codes using Ramanujan graphs and ideas from Margulis," in Proc. 2001 IEEE Int. Symp. Information Theory, Washington, DC, June 2001, p. 4.
16. S. J. Johnson and S. R. Weller, "Regular low-density parity-check codes from combinatorial designs," in Proc. 2001 IEEE Information Theory Workshop, Cairns, Australia, Sept. 2-7, 2001, pp. 90-92.
17. T. Beth, D. Jungnickel, and H. Lenz, Design Theory. Cambridge, U.K.: Cambridge Univ. Press, 1986.
18. C. J. Colbourn, J. H. Dinitz, and D. R. Stinson, "Applications of combinatorial designs to communications, cryptography, and networking," in Surveys in Combinatorics 1999. Cambridge, U.K.: Cambridge Univ. Press, pp. 37-100.
19. C. J. Colbourn and J. H. Dinitz, Eds., The Handbook of Combinatorial Designs. Boca Raton, FL: CRC Press, 1996.
20. C. J. Colbourn and A. Rosa, Triple Systems. London, U.K.: Oxford Univ. Press, 1999.
21. ____, Steiner Systems. London, U.K.: Oxford Univ. Press, 1999, Oxford Mathematical Monographs.
22. B. Vasic, "Low-density parity-check codes: Theory and practice," presented at the National Storage Industry Consortium (NSIC) Quarterly Meeting, Monterey, CA, June 25-28, 2000.
23. ____, "Structured iteratively decodable codes based on Steiner systems and their application in magnetic recording," in Proc. GLOBECOM 2001, vol. 5, San Antonio, TX, Nov. 26-29, 2001, pp. 2954-2960.
24. B. Vasic, E. Kurtas, and A. Kuznetsov, "Lattice low-density parity-check codes and their application in partial response channels," in Proc. 2002 IEEE Int. Symp. Information Theory, Lausanne, Switzerland, June/July 2002, p. 453.
25. R. C. Bose, "On the construction of balanced incomplete block designs," Ann. Eugenics, vol. 9, pp. 353-399, 1939.
26. ____, "An affine analogue of Singer's theorem," Ind. Math. Soc., vol. 6, pp. 1-5, 1942.
27. E. Netto, Zur Theorie der Tripelsysteme, Math. Ann., vol. 42, pp. 143-152, 1893.
28. M. Buratti, "Construction of (q, k, 1) difference families with q a prime power and k = 4,5," Discr. Math., vol. 138, pp. 169-175, 1995.
29. V. K. Bhargava and J. M. Stein, "(v, k, λ) configurations and self-dual codes," Inform. Contr., vol. 28, pp. 352-355, 1975.
30. E. Spence and V. D. Tonchev, "Extremal self-dual codes from symmetric designs," Discr. Math., vol. 110, pp. 165-268, 1992.
31. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes: North-Holland, 1977.
32. B. Vasic, "Combintorial constructions of structured low-density parity-check codes for iterative decoding," in Proc. 2001 IEEE Information Theory Workshop, Cairns, Australia, Sept. 2001.
33. ____, "Combinatorial construction of low-density parity-check codes," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, June/July 2002, p. 312.
34. ____, "High-rate low-density parity-check codes based on anti-Pasch affine geometries," in Proc. IEEE Int. Conf. Communications (ICC 2002), vol. 3, New York, Apr./May, pp. 1332-1336.
35. B. Vasic, E. Kurtas and A. Kuznetsov, "LDPC codes based on mutually orthogonal Latin rectangles and their application in perpendicular magnetic recording," IEEE Trans. Magn., pt. 1, vol. 38, pp. 2346-2348, Sept. 2002.
36. B. Vasic and I. Djordjevic, "Low-density parity-check codes for long-haul optical communication systems," IEEE Photonics Technol. Lett., vol. 14, pp. 1208-1210, Aug. 2002.
37. B. Vasic, E. Kurtas, and A. Kuznetsov, "Kirkman systems and their application in perpendicular magnetic recording," IEEE Trans. Magn., pt. 1, vol. 38, pp. 1705-1710, July 2002.
38. D. MacKay and M. Davey. Evaluation of Gallager Codes for Short Block Length and High-Rate Applications. [Online]. Available: http://www.cs.toronto.edu/~mackay/CodesRegular.html
39. R. M. Tanner, "Minimum-distance bounds by graph analysis," IEEE Trans. Inform. Theory, vol. 47, pp. 808-821, Feb. 2001.
40. T. P. Kirkman, "Note on an unanswered prize question," Cambridge and Dublin Math. J., vol. 5, pp. 255-262, 1850.
41. A. C. H. Ling and C. J. Colbourn, "Rosa triple systems," in Geometry, Combinatorial Designs and Related Structures, J. W. P. Hirschfeld, S. S. Magliveras, and M. J. de Resmini, Eds. Cambridge, U.K.: Cambridge Univ. Press, 1997, pp. 149-159.
42. J. H. van Lint and R. M. Wilson, A Course in Combinatorics. Cambridge, U.K.: Cambridge Univ. Press, 1992.
43. N. Hamada, "On the p-rank of the incidence matrix of a balanced or partially balanced incomplete block design and its applications to error-correcting codes," Hiroshima Math. J., vol. 3, pp. 153-226, 1973.
44. R. Townsend and E. J. Weldon, "Self-orthogonal quasicyclic codes," IEEE Trans. Inform. Theory, vol. IT-13, pp. 183-195, Apr. 1967.
45. E. J. Weldon Jr., "Difference-set cyclic codes," Bell Syst. Tech. J., vol. 45, pp. 1045-1055, Sept. 1966.
46. A. C. Ling, C. J. Colbourn, M. J. Grannell and T. S. Griggs, "Construction techniques for anti-Pasch Steiner triple systems," J. London Math. Soc., vol. 61, no. 3, pp. 641-657, June 2000.
47. R. A. Beezer, "The girth of a design," J. Comb. Math. and Comb. Comput., to be published.
48. R. J. McEliece, Finite Fields for Computer Scientist and Engineers. Boston, MA: Kluwer Academic, 1987.
49. R. M. Wilson, "Cyclotomy and difference families in elementary Abelian groups," J. Number Theory, vol. 4, pp. 17-47, 1972.
50. I. Anderson, Combinatorial Designs and Tournaments. Oxford, U.K.: Oxford Science/Claredon, 1997.
51. M. J. Colbourn and C. J. Colbourn, "Recursive construction for cyclic block designs," J. Statist. Planning Infer., vol. 10, pp. 97-103, 1984.
52. L. M. Batten, Combinatorics of Finite Geometries. London, U.K.: Cambridge Univ. Press, 1997.
53. M. A. Margulis, "Explicit group-theoretic constructions for combinatorial designs with applications to expanders and concentrators," Probl. Pered. Inform., vol. 24, no. 1, pp. 51-60, 1988.
54. F. Karteszi, Introduction to Finite Geometries. Amsterdam, The Netherlands: North-Holland, 1976.
55. S. Weller and S. Johnson, "Iterative decoding of codes from oval designs," in Proc. Defence Applications of Signal Processing, 2001 Workshop, Adelaide, Australia, Sept. 2001.
56. E. F. Assmus and J. D. Key, Designs and their Codes. London, U.K.: Cambridge Univ. Press, 1994.
57. W. D. Wallis, Combinatorial Designs. New York: Marcel Dekker, 1988.
58. J. Singer, "A theorem in finite projective geometry and some applications to number theory," AMS Trans., vol. 43, pp. 377-385, 1938.
59. C. C. Lindner and C. A. Rodger, Design Theory. Boca Raton, FL: CRC Press, 1997.
60. M. Blaum, P. Farrell and H. van Tilborg, "Array codes," in Handbook of Coding Theory, V. Pless and W. Huffman, Eds. Amsterdam, The Netherlands: Elsevier, 1998.
61. J. L. Fan, "Array codes as low-density parity-check codes," in Proc. 2nd Int. Symp. Turbo Codes and Related Topics, Brest, France, Sept. 2000, pp. 543-546.
62. E. Eleftheriou and S. Olcer, "Low-density parity-check codes for digital subscriber lines," in Proc. IEEE Int. Conf. Communications (ICC 2002), vol. 3, 2002, pp. 1752-1757.
63. J.-L. Kim, U. Peled, I. Perepelitsa, and V. Pless, "Explicit construction of families of LDPC codes with girth at least six," presented at the 40th Annual Allerton Conference on Communications, Control and Computing, Oct. 2002.
64. J. Baker, F. Hiergeist, and G. Trapp, "The structure of multi-block circulants," Kyungpook Math. J., vol. 25, no. 1, June 1985.
65. W. W. Peterson and E. J. Weldon Jr., Error-Correcting Codes. Cambridge, MA: MIT Press, 1963.
66. H. Song, J. Liu, and B. V. Kumar, "Low complexity LDPC codes for partial response channels," unpublished manuscript.
67. F. Lazebnik and V. A. Ustimenko, "Explicit construction of graphs with arbitrary large girth and of large size," Discr. Appl. Math., vol. 60, pp. 275-284, 1997.
68. S. Litsyn and V. Shevelev, "On ensembles of low-density parity-check codes: Asymptotic distance distributions," IEEE Trans. Inform. Theory, vol. 48, pp. 887-908, Apr. 2002.
69. M. Odlyzko and R. P. Stanley, "Some Curious Sequences Constructed with the Greedy Algorithm," Bell Labs Internal Memo., 1978.
70. N. J. Sloane and S. Plouffe, The Encyclopedia of Integer Sequences. San Diego, CA: Academic, 1995.
71. B. Vasic, M. Ivkovic, K. Pedagani, and A. Cvetkovic, "High-rate girth-eight low-density parity-check codes on rectangular integer lattices," IEEE Trans. Commun., submitted for publication.
72. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Mateo, CA: Morgan Kaufmann, 1988.
73. D. Mackay's Homepage [Online]. Available: www.inference.phy.cam.ac.uk/mackay/CodesFiles.html
74. R. Niel's Homepage [Online]. Available: ftp://ftp.cs.utoronto.ca/pub/radford/LDPC-2001-11-18/index.html/