Capacity-achieving ensembles for the binary erasure channel with bounded complexity. Pfister, H. D., Sason, I., & Urbanke, R. L. IEEE Trans. Inf. Theory, 51(7):2352-2379, 2005.
Capacity-achieving ensembles for the binary erasure channel with bounded complexity. [link]Link  Capacity-achieving ensembles for the binary erasure channel with bounded complexity. [link]Paper  bibtex   
@article{journals/tit/PfisterSU05,
  added-at = {2020-03-10T00:00:00.000+0100},
  author = {Pfister, Henry D. and Sason, Igal and Urbanke, Rüdiger L.},
  biburl = {https://www.bibsonomy.org/bibtex/2396bbe1cbe6d619b2cb790ae24f0d3e5/dblp},
  ee = {https://doi.org/10.1109/TIT.2005.850079},
  interhash = {8e739900dc2a6b9ae6b75bae28e1d110},
  intrahash = {396bbe1cbe6d619b2cb790ae24f0d3e5},
  journal = {IEEE Trans. Inf. Theory},
  keywords = {dblp},
  number = 7,
  pages = {2352-2379},
  timestamp = {2020-03-11T11:55:14.000+0100},
  title = {Capacity-achieving ensembles for the binary erasure channel with bounded complexity.},
  url = {http://dblp.uni-trier.de/db/journals/tit/tit51.html#PfisterSU05},
  volume = 51,
  year = 2005
}

Downloads: 0