Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity
From MaRDI portal
Publication:3547478
DOI10.1109/TIT.2005.850079zbMath1310.94077arXivcs/0409026MaRDI QIDQ3547478
Henry David Pfister, Ruediger Urbanke, Igal Sason
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0409026
Related Items (1)
This page was built for publication: Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity