Minimum distance and pseudodistance lower bounds for generalised LDPC codes

Authors:
Christine A. Kelley
Affiliations:
Department of Mathematics, University of Nebraska-Lincoln, Lincoln, NE 68588, USA
Venue:
International Journal of Information and Coding Theory
Year:
2010

Citing 6
Cited 0

Expander codes

IEEE Transactions on Information Theory - Part 1
Design of capacity-approaching irregular low-density parity-check codes

IEEE Transactions on Information Theory
Minimum-distance bounds by graph analysis

IEEE Transactions on Information Theory
Finite-length analysis of low-density parity-check codes on the binary erasure channel

IEEE Transactions on Information Theory
Using linear programming to Decode Binary linear codes

IEEE Transactions on Information Theory
Pseudocodewords of Tanner Graphs

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.01

Visualization

Abstract

Two different ways of obtaining generalised low-density parity-check (LDPC) codes are considered. Lower bounds on the minimum distance, stopping distance and pseudodistance are derived for these codes using graph-based analysis. These bounds are generalisations of Tanner's bit- and parity-oriented bound for simple (LDPC) codes. The new bounds are useful in predicting the performance of generalised LDPC codes under maximum-likelihood decoding, graph-based iterative decoding and linear programming decoding, and rely on the connectivity of the Tanner graph.