High-rate girth-eight low-density parity-check codes on rectangular integer lattices

IEEE Transactions on Communications

Volumn 52, Issue 8, 2004, Pages 1248-1252

  Vasic, Bane ^a   Pedagani, Karunakar ^a   Ivkovic, Milos ^b  

^a University of Arizona   (United States)

^b University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BLOCK CODES; COMPUTER SIMULATION; DECODING; ERROR ANALYSIS; GEOMETRY; GRAPH THEORY; ITERATIVE METHODS; MATRIX ALGEBRA; THEOREM PROVING;

COMBINATORIAL DESIGN; ERROR CONTROL CODING; FINITE GEOMETRIES; GIRTH EIGHT CODES; HIGH RATE CODES; LOW DENSITY PARITY CHECK CODES;

ENCODING (SYMBOLS);

EID: 4444307239     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2004.833037     Document Type: Article

References (24)

1. L. M. Batten, Combinatorics of Finite Geometries. London, U.K.: Cambridge Univ. Press, 1997.
2. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
3. 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.
4. 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.
5. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Mateo, CA: Morgan Kaufmann, 1988.
6. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. IT-27, pp. 533-547, Sept. 1981.
7. B. Vasic, "Combinatorial constructions of structured low-density parity-check codes for iterative decoding," in Proc. IEEE Information Theory Workshop, 2001, p. 134.
8. R. A. Beezer, "The girth of a design," J. Combinatorial Math. Combinatorial Comput., to be published.
9. 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.
10. 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.
11. G. D. Fomey, Jr., "Codes on graphs: Normal realizations," IEEE Trans. Inform. Theory, vol. 47, pp. 520-548, Feb. 2001.
12. N. Wiberg, H.-A. Loeliger, and R. Kötter, "Codes and iterative decoding on general graphs," Eur. Trans. Telecommun., vol. 6, pp. 513-525, Sept./Oct. 1995.
13. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, Mar. 1999.
14. D. J. C. MacKay and R. M. Neal, "Good codes based on very sparse matrices," in Proc. IMA Conf. Cryptography, Coding, vol. 1025, Lecture Notes Comput. Sci., C. Boyd, Ed., 1995, pp. 110-111.
15. 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.
16. T. H. Cormen, C. E. Leiserdon, and R. L. Rivest, Introduction to Algorithms. New York: McGraw-Hill, 1989.
17. 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. Communications, Control, Computing, Oct. 2002, pp. 1024-1031.
18. I. J. Rosenthal and P. O. Vontobel, "Construction of LDPC codes using Ramanujan graphs and ideas from Margulis," in Proc. IEEE Int. Symp. Information Theory, 2001, p. 4.
19. 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.
20. B. Vasic, "Combinatorial construction of low-density parity-check codes," in Proc. IEEE Int. Symp. Information Theory, Lausanne, Switzerland, June-July 2002, p. 312.
21. 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.
22. M. Odlyzko and R. P. Stanley, "Some curious sequences constructed with the greedy algorithm,", Bell Labs Internal Memo., 1978.
23. 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.
24. M. A. Margulis, "Explicit group-theoretic constructions for combinatorial designs with applications to expanders and concentrators," Problemy Peredachi Informatsii, vol. 24, no. 1, pp.