TY - JOUR
T1 - Combinatorial constructions of low-density parity-check codes for iterative decoding
AU - Vasic, Bane
AU - Milenkovic, Olgica
N1 - Funding Information:
We thank Yuan Kuen-Ko for very helpful discussions. This work was performed under contract with the Naval Research Laboratory and was funded by the NASA Hinode program. Hinode is a Japanese mission developed and launched by ISAS/ JAXA, with NAOJ as domestic partner and NASA and STFC (UK) as international partners. It is operated by these agencies in co-operation with ESA and NSC (Norway).
PY - 2004/6
Y1 - 2004/6
N2 - This paper introduces several new combinatorial constructions of low-density parity-check (LDPC) codes, in contrast to the prevalent practice of using long, random-like codes. The proposed codes are well structured, and unlike random codes can lend themselves to a very low-complexity implementation. Constructions of regular Gallager codes based on cyclic difference families, cycle-invariant difference sets, and affine 1-configurations are introduced. Several constructions of difference families used for code design are presented, as well as bounds on the minimal distance of the codes based on the concept of a generalized Pasch configuration.
AB - This paper introduces several new combinatorial constructions of low-density parity-check (LDPC) codes, in contrast to the prevalent practice of using long, random-like codes. The proposed codes are well structured, and unlike random codes can lend themselves to a very low-complexity implementation. Constructions of regular Gallager codes based on cyclic difference families, cycle-invariant difference sets, and affine 1-configurations are introduced. Several constructions of difference families used for code design are presented, as well as bounds on the minimal distance of the codes based on the concept of a generalized Pasch configuration.
KW - Cyclic difference families
KW - Iterative decoding
KW - Low-density parity-check (LDPC) codes
KW - Pasch configurations
UR - http://www.scopus.com/inward/record.url?scp=2942659753&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=2942659753&partnerID=8YFLogxK
U2 - 10.1109/TIT.2004.828066
DO - 10.1109/TIT.2004.828066
M3 - Article
AN - SCOPUS:2942659753
SN - 0018-9448
VL - 50
SP - 1156
EP - 1176
JO - IEEE Transactions on Information Theory
JF - IEEE Transactions on Information Theory
IS - 6
ER -