LDPC codes from voltage graphs

@article{Kelley2008LDPCCF,
  title={LDPC codes from voltage graphs},
  author={Christine A. Kelley and Judy L. Walker},
  journal={2008 IEEE International Symposium on Information Theory},
  year={2008},
  pages={792-796}
}
Several well-known structure-based constructions of LDPC codes, for example codes based on permutation and circulant matrices and in particular, quasi-cyclic LDPC codes, can be interpreted via algebraic voltage assignments. We explain this connection and show how this idea from topological graph theory can be used to give simple proofs of many known properties of these codes. In addition, the notion of Abelian-inevitable cycle is introduced and the subgraphs giving rise to these cycles are… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS

Citations

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

References

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

Graph - cover decoding and fi nitelength analysis of message - passing iterative decoding of LDPC codes ” , IEEE Transactions on Information Theory , to appear

  • R. Koetter
  • ISIT
  • 2008

A comparison of ARA and protograph-based LDPC block and convolutional codes

  • D. J. Costello, Jr., A. Pusane, Jones, D. Divsalar
  • Proceedings of the 2007 Information Theory and…
  • 2007
1 Excerpt

Characterizations of pseudo-codewords of (low-density) parity check codes

  • R. Koetter, W.-C.W. Li, P. O. Vontobel, J. L. Walker
  • Advances in Mathematics, pp. 205-229, vol. 213
  • 2007
1 Excerpt

On LDPC codes from voltage graphs

  • C. A. Kelley, J. L. Walker
  • Special Session on Algebraic Coding Theory, AMS…
  • 2007
1 Excerpt

Construction of protograph LDPC codes with minimum distance linearly growing with block size ”

  • S. Dolinar D. Divsalar, C. Jones
  • IEEE Globecom
  • 2005

Similar Papers

Loading similar papers…