LDPC codes from voltage graphs

Christine A Kelley, Judy L. Walker

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Citations (Scopus)

Abstract

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 abelianinevitable cycle is introduced and the subgraphs giving rise to these cycles are classified. We also indicate how, by using more sophisticated voltage assignments, new classes of good LDPC codes may be obtained

Original languageEnglish (US)
Title of host publicationProceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Pages792-796
Number of pages5
DOIs
StatePublished - Sep 29 2008
Event2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada
Duration: Jul 6 2008Jul 11 2008

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Other

Other2008 IEEE International Symposium on Information Theory, ISIT 2008
CountryCanada
CityToronto, ON
Period7/6/087/11/08

Fingerprint

LDPC Codes
Voltage
Graph theory
Electric potential
Assignment
Topological Graph Theory
Graph in graph theory
Quasi-cyclic Codes
Cycle
Permutation Matrix
Circulant Matrix
Subgraph

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

Kelley, C. A., & Walker, J. L. (2008). LDPC codes from voltage graphs. In Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008 (pp. 792-796). [4595095] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2008.4595095

LDPC codes from voltage graphs. / Kelley, Christine A; Walker, Judy L.

Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008. 2008. p. 792-796 4595095 (IEEE International Symposium on Information Theory - Proceedings).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kelley, CA & Walker, JL 2008, LDPC codes from voltage graphs. in Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008., 4595095, IEEE International Symposium on Information Theory - Proceedings, pp. 792-796, 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, ON, Canada, 7/6/08. https://doi.org/10.1109/ISIT.2008.4595095
Kelley CA, Walker JL. LDPC codes from voltage graphs. In Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008. 2008. p. 792-796. 4595095. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2008.4595095
Kelley, Christine A ; Walker, Judy L. / LDPC codes from voltage graphs. Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008. 2008. pp. 792-796 (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{862371149d96414d8c968e1fb91081ee,
title = "LDPC codes from voltage graphs",
abstract = "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 abelianinevitable cycle is introduced and the subgraphs giving rise to these cycles are classified. We also indicate how, by using more sophisticated voltage assignments, new classes of good LDPC codes may be obtained",
author = "Kelley, {Christine A} and Walker, {Judy L.}",
year = "2008",
month = "9",
day = "29",
doi = "10.1109/ISIT.2008.4595095",
language = "English (US)",
isbn = "9781424422579",
series = "IEEE International Symposium on Information Theory - Proceedings",
pages = "792--796",
booktitle = "Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008",

}

TY - GEN

T1 - LDPC codes from voltage graphs

AU - Kelley, Christine A

AU - Walker, Judy L.

PY - 2008/9/29

Y1 - 2008/9/29

N2 - 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 abelianinevitable cycle is introduced and the subgraphs giving rise to these cycles are classified. We also indicate how, by using more sophisticated voltage assignments, new classes of good LDPC codes may be obtained

AB - 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 abelianinevitable cycle is introduced and the subgraphs giving rise to these cycles are classified. We also indicate how, by using more sophisticated voltage assignments, new classes of good LDPC codes may be obtained

UR - http://www.scopus.com/inward/record.url?scp=52349086627&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=52349086627&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2008.4595095

DO - 10.1109/ISIT.2008.4595095

M3 - Conference contribution

SN - 9781424422579

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 792

EP - 796

BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008

ER -