|Publisher version (open access)||159 KB||Adobe Acrobat PDF||View/Open
Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/31008
- Construction of low-density parity-check codes from Kirkman triple systems
Johnson, Sarah J.;
Weller, Steven R.
- Gallager introduced low-density parity-check (LDPC) codes in 1962, presenting a construction method to randomly allocate bits in the parity-check matrix subject to certain structural constraints. Since then improvements have been made to Gallager's construction method and some analytic constructions for LDPC codes have been presented. However analytically constructed LDPC codes comprise only a very small subset of possible codes and as a result LDPC codes are still, for the most part, constructed randomly. This paper extends the class of LDPC codes that can be systematically generated by presenting a construction method for regular LDPC codes based on combinatorial designs known as Kirkman triple systems. That is, we construct (3, ρ)-regular codes whose Tanner (1981) graph is free of 4-cycles for any integer ρ.
- IEEE Global Telecommunications Conference, 2001 (GLOBECOM '01). Proceedings of the IEEE Global Telecommunications Conference, 2001 (GLOBECOM '01). Volume 2 (San Antonio, TX 25-29 November, 2001) p. 970-974
- Publisher Link
- Institute of Electrical and Electronics Engineers (IEEE)
Kirkman triple systems;
low-density parity-check (LDPC) codes;
belief propagation decoding;
- Resource Type
- conference paper
- Copyright © 2001 IEEE. Reprinted from IEEE Global Telecommunications Conference 2001 (GLOBECOM '01), Vol. 2, p. 970-974. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Newcastle's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to firstname.lastname@example.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
- Full Text