Resolvable 2-designs for regular low-density parity-check codes |
| |
| Authors: | Johnson SJ Weller SR |
| |
| Affiliation: | 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, /spl rho/)-regular or (4, /spl rho/)-regular for any value of /spl rho/ and for a flexible choice of code lengths. |
| |
| Keywords: | |
|
|
