Capacity-achieving ensembles for the binary erasure channel with bounded complexity
Conferences
Pfister, H; Sason, I; Urbanke, R
Published in: IEEE International Symposium on Information Theory Proceedings
January 1, 2004
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 Scholars
Altmetric Attention Stats
Dimensions Citation Stats
Published In
IEEE International Symposium on Information Theory Proceedings
DOI
ISSN
2157-8095
Publication Date
January 1, 2004
Start / End Page
207
Citation
APA
Chicago
ICMJE
MLA
NLM
Pfister, H., Sason, I., & Urbanke, R. (2004). Capacity-achieving ensembles for the binary erasure channel with bounded complexity. In IEEE International Symposium on Information Theory Proceedings (p. 207). https://doi.org/10.1109/ISIT.2004.1365246
Pfister, H., I. Sason, and R. Urbanke. “Capacity-achieving ensembles for the binary erasure channel with bounded complexity.” In IEEE International Symposium on Information Theory Proceedings, 207, 2004. https://doi.org/10.1109/ISIT.2004.1365246.
Pfister H, Sason I, Urbanke R. Capacity-achieving ensembles for the binary erasure channel with bounded complexity. In: IEEE International Symposium on Information Theory Proceedings. 2004. p. 207.
Pfister, H., et al. “Capacity-achieving ensembles for the binary erasure channel with bounded complexity.” IEEE International Symposium on Information Theory Proceedings, 2004, p. 207. Scopus, doi:10.1109/ISIT.2004.1365246.
Pfister H, Sason I, Urbanke R. Capacity-achieving ensembles for the binary erasure channel with bounded complexity. IEEE International Symposium on Information Theory Proceedings. 2004. p. 207.
Published In
IEEE International Symposium on Information Theory Proceedings
DOI
ISSN
2157-8095
Publication Date
January 1, 2004
Start / End Page
207