Math @ Duke

Publications [#322722] of Henry Pfister
Papers Published
 Pfister, H; Sason, I; Urbanke, R, Capacityachieving ensembles for the binary erasure channel with bounded complexity,
IEEE International Symposium on Information Theory  Proceedings
(October, 2004),
pp. 207
(last updated on 2018/10/23)
Abstract: We present two sequences of ensembles of nonsystematic irregular repeataccumulate 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 capacityachieving 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.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

