Capacity-achieving ensembles for the binary erasure channel with bounded complexity


Conference Paper

We present two sequences of ensembles of non-systematic irregular repeat-accumulate codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel (BEC) with bounded complexity. This is in contrast to all previous constructions of capacity-achieving sequences of ensembles whose complexity grows at least like the log of the inverse of the gap to capacity. The new bounded complexity result is achieved by allowing a sufficient number of state nodes in the Tanner graph representing the codes.

Duke Authors

Cited Authors

  • Pfister, H; Sason, I; Urbanke, R

Published Date

  • October 20, 2004

Published In

  • Ieee International Symposium on Information Theory Proceedings

Start / End Page

  • 207 -

Citation Source

  • Scopus