On Convergence Speed of Capacity-Achieving Sequences for Erasure Channel

DOI10.1109/TIT.2008.917662MaRDI QIDQ3604684zbMATH OpenFDO

Authors Min Lu

Publication date 24 February 2009

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2008.917662

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Other types of codes (94B60)

Recommendations

• Capacity-achieving sequences for the erasure channel
• scientific article; zbMATH DE number 1714654
• Reed-Muller codes achieve capacity on erasure channels
• Finite-length analysis of low-density parity-check codes on the binary erasure channel
• Parity-check density versus performance of binary linear block codes over memoryless symmetric channels

Cited in

(2)

• Capacity-Achieving Ensembles for the Binary Erasure Channel With Bounded Complexity
• Capacity-achieving sequences for the erasure channel

This page was built for publication: On Convergence Speed of Capacity-Achieving Sequences for Erasure Channel

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604684)