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

Henry D. Pfister, Igal Sason, RĂ¼diger L. Urbanke. Capacity-achieving ensembles for the binary erasure channel with bounded complexity. In Proceedings of the 2004 IEEE International Symposium on Information Theory, ISIT 2004, Chicago Downtown Marriott, Chicago, Illinois, USA, June 27 - July 2, 2004. pages 207, IEEE, 2004. [doi]

Abstract

Abstract is missing.