Computer Science – Information Theory
Scientific paper
2004-09-14
Computer Science
Information Theory
11 pages, 3 figures. To appear in the Proc. Forty-Second Annual Allerton Conference on Communication, Control and Computing,
Scientific 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 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 also 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 channel, and is refined for the BEC.
Pfister Hanspeter
Sason Igal
Urbanke Rudiger
No associations
LandOfFree
Bounds on the decoding complexity of punctured codes on graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Bounds on the decoding complexity of punctured codes on graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds on the decoding complexity of punctured codes on graphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-415253