TY - GEN
T1 - LDPC codes from voltage graphs
AU - Kelley, Christine A.
AU - Walker, Judy L.
PY - 2008
Y1 - 2008
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
AN - SCOPUS:52349086627
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
T2 - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Y2 - 6 July 2008 through 11 July 2008
ER -