A finite-length algorithm for LDPC codes without repeated edges on the binary erasure channel

Authors:
Sarah J. Johnson
Affiliations:
School of Electrical Engineering and Computer Science, The University of Newcastle, Callaghan, NSW, Australia
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 4
Cited 0

Good error-correcting codes based on very sparse matrices

IEEE Transactions on Information Theory
Efficient erasure correcting codes

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

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

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.84

Visualization

Abstract

This paper considers the performance, on the binary erasure channel, of low-density parity-check (LDPC) codes without repeated edges in their Tanner graphs. A modification to existing finite-length analysis algorithms is presented for these codes.