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

@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}
}
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. 
Highly Cited
This paper has 45 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
Showing 1-10 of 28 extracted citations

(5, k) regular LDPC codes using novel code-construction

2010 International Conference on Intelligent and Advanced Systems • 2010

References

Publications referenced by this paper.
Showing 1-10 of 38 references

Low-density parity-check codes

IRE Trans. Information Theory • 1962
View 4 Excerpts
Highly Influenced

Codes on finite geometries

IEEE Transactions on Information Theory • 2005
View 2 Excerpts

Codes for iterative decoding from partial geometries

IEEE Transactions on Communications • 2004
View 1 Excerpt

Regular low-density parity-check codes from oval designs

European Transactions on Telecommunications • 2003
View 1 Excerpt

Kirkman systems and their application in perpendicular magnetic recording

B. Vasic, E. M. Kurtas, A. V. Kuznetsov
IEEE Trans. Magn., vol. 38, pp. 1705–1710, July 2002. • 2002
View 3 Excerpts

Rate-compatible low-density parity-check codes for digital subscriber lines

2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577) • 2002
View 1 Excerpt

Stopping sets and the girth of Tanner graphs

A. Orlitsky, R. L. Urbanke, K. Viswanathan, J. Zhang
Proc. Int. Symp. Information Theory, Lausanne, Switzerland, June 30–July 5, 2002, p. 2. IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 51, NO. 9, SEPTEMBER 2003 1419 • 2002
View 1 Excerpt

Construction of codes based on finite generalized quadrangles for iterative decoding

P. O. Vontobel, R. M. Tanner
Proc. Int. Symp. Information Theory, Washington, DC, June 24–29, 2001, p. 223. • 2001
View 1 Excerpt

Similar Papers

Loading similar papers…