A Simple Lower Bound for the Capacity of the Deletion Channel

DOI10.1109/TIT.2006.881844MaRDI QIDQ3547899zbMATH OpenFDO

Authors Eleni Drinea, Michael Mitzenmacher

Publication date 21 December 2008

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

Mathematics Subject Classification ID

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

Recommendations

• Capacity Upper Bounds for Deletion-type Channels
• Capacity upper bounds for deletion-type channels
• On Lower Bounds for the Capacity of Deletion Channels
• Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels
• A survey of results for deletion channels and related synchronization channels

Cited in

(8)

• 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
• Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels
• On Lower Bounds for the Capacity of Deletion Channels
• Information-Theoretic Foundations of DNA Data Storage
• Capacity Bounds for Sticky Channels

This page was built for publication: A Simple Lower Bound for the Capacity of the Deletion Channel

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