Resolvable 2-designs for regular low-density parity-check codes


This paper extends the class of low-density paritycheck (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 -regular or -regular for any value of and for a flexible choice of code lengths. 
DOI: 10.1109/TCOMM.2003.816946


4 Figures and Tables

Cite this paper

@article{Johnson2003Resolvable2F, title={Resolvable 2-designs for regular low-density parity-check codes}, author={Sarah J. Johnson and Steven R. Weller}, journal={IEEE Trans. Communications}, year={2003}, volume={51}, pages={1413-1419} }