On Lower Bounds for the Capacity of Deletion Channels

DOI10.1109/TIT.2006.881832MaRDI QIDQ3547905zbMATH OpenFDO

Authors Eleni Drinea, Michael Mitzenmacher

Publication date 21 December 2008

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

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

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• A Simple Lower Bound for the Capacity of the Deletion Channel
• Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels
• Capacity upper bounds for deletion-type channels
• Capacity Upper Bounds for Deletion-type Channels
• Efficiently decodable codes for the binary deletion channel

Cited in

(6)

• A Simple Lower Bound for the Capacity of the Deletion Channel
• Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels
• Capacity upper bounds for deletion-type channels
• Capacity Upper Bounds for Deletion-type Channels
• A binary deletion channel with a fixed number of deletions
• A survey of results for deletion channels and related synchronization channels

This page was built for publication: On Lower Bounds for the Capacity of Deletion Channels

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