Bounds on achievable rates of LDPC codes used over the binary erasure channel

Authors:
O. Barak;D. Burshtein;M. Feder
Affiliations:
Sch. of Electr. Eng., Tel-Aviv Univ., Israel;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2006

Citing 0
Cited 4

Parameter selection for Wyner–Ziv coding of laplacian sources with additive laplacian or gaussian innovation

IEEE Transactions on Signal Processing
Bounds on the number of iterations for turbo-like ensembles over the binary erasure channel

IEEE Transactions on Information Theory
Systematic design of low-density parity-check code ensembles for binary erasure channels

IEEE Transactions on Communications
Bounds on rates of LDPC codes for BEC with varying erasure rate

IEEE Transactions on Communications

Quantified Score

Hi-index	754.90

Visualization

Abstract

We derive upper bounds on the maximum achievable rate of low-density parity-check (LDPC) codes used over the binary erasure channel (BEC) under Gallager's decoding algorithm, given their right-degree distribution. We demonstrate the bounds on the ensemble of right-regular LDPC codes and compare them with an explicit left-degree distribution constructed from the given right degree.