|Publisher version (open access)||384 KB||Adobe Acrobat PDF||View/Open
Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.13/31002
- Regular low-density parity-check codes from combinatorial designs
Johnson, Sarah J.;
Weller, Steven R.
- 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. We construct (3, ρ)-regular codes whose Tanner graph is free of 4-cycles for any integer ρ, and examine girth and minimum distance properties of several classes of LDPC codes obtained from combinatorial designs.
- 2001 IEEE Information Theory Workshop. Proceedings of the 2001 IEEE Information Theory Workshop (Cairns, Qld. 2-7 September, 2001) p. 90-92
- Publisher Link
- Institute of Electrical and Electronics Engineers (IEEE)
low-density parity-check (LDPC) codes;
Kirkman triple systems;
minimum distance properties;
- Resource Type
- conference paper
- Copyright © 2001 IEEE. Reprinted from Proceedings of the 2001 IEEE Information Theory Workshop, p. 90-92. 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 email@example.com. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.
- Full Text