Title :
Resolvable 2-designs for regular low-density parity-check codes
Author :
Johnson, Sarah J. ; Weller, Steven R.
Author_Institution :
Sch. of Electr. Eng. & Comput. Sci., Univ. of Newcastle, Callaghan, NSW, Australia
Abstract :
This paper extends the class of low-density parity-check (LDPC) codes that can be algebraically constructed. We present regular LDPC codes based on resolvable Steiner 2-designs which have Tanner graphs free of four-cycles. The resulting codes are (3, ρ)-regular or (4, ρ)-regular for any value of ρ and for a flexible choice of code lengths.
Keywords :
iterative decoding; parity check codes; LDPC; Tanner graphs; code lengths; iterative decoding; low-density parity-check codes; resolvable Steiner 2-designs; Australia; Communication industry; Communications Society; Error analysis; Iterative algorithms; Iterative decoding; Parity check codes; Physics; Scholarships; Turbo codes;
Journal_Title :
Communications, IEEE Transactions on
DOI :
10.1109/TCOMM.2003.816946
