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 (IRA) codes which asymptotically (as their block length tends to infinity) achieve capacity on the binary erasure channel (BEC) with bounded complexity per information bit. 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 (in rate) to capacity. The new bounded complexity result is achieved by puncturing bits, and allowing in this way a sufficient number of state nodes in the Tanner graph representing the codes. We derive an information-theoretic lower bound on the decoding complexity of randomly punctured codes on graphs. The bound holds for every memoryless binary-input output-symmetric (MBIOS) channel and is refined for the binary erasure channel. © 2005 IEEE.

Full Text

Duke Authors

Cited Authors

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

Published Date

  • July 1, 2005

Published In

Volume / Issue

  • 51 / 7

Start / End Page

  • 2352 - 2379

International Standard Serial Number (ISSN)

  • 0018-9448

Digital Object Identifier (DOI)

  • 10.1109/TIT.2005.850079

Citation Source

  • Scopus