Loading...
conference paper
Finite-Length Scaling For Gallager A
2006
Proc. 44th Annual Allerton Conference on Communication, Control and Computing
We consider LDPC codes, transmission over the binary symmetric channel (BSC), and decoding using Gallager's algorithm A. For those ensembles whose threshold is determined by the behavior of the algorithm at the beginning of the decoding process we derive a scaling law. This scaling law has the same form as the scaling law which was established for the the case of transmission over the binary erasure channel (BEC). We show how the scaling parameters can be computed and point out some interesting open challenges.
Type
conference paper
Authors
Publication date
2006
Published in
Proc. 44th Annual Allerton Conference on Communication, Control and Computing
Subjects
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
December 7, 2006
Use this identifier to reference this record