Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels

DOI10.1109/TIT.2007.901221zbMATH Open1325.94058MaRDI QIDQ3548896FDOQ3548896

Authors: Eleni Drinea, Michael Mitzenmacher 

Publication date: 21 December 2008

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

Recommendations

• A Simple Lower Bound for the Capacity of the Deletion Channel
• On Lower Bounds for the Capacity of Deletion Channels
• Capacity Bounds for Sticky Channels
• Capacity upper bounds for deletion-type channels
• Capacity Upper Bounds for Deletion-type Channels

zbMATH Keywords

channel capacitychannels with synchronization errorsbinary deletion channel

Mathematics Subject Classification ID

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

Cited In (7)

• Capacity upper bounds for deletion-type channels
• Capacity Upper Bounds for Deletion-type Channels
• A binary deletion channel with a fixed number of deletions
• On the maximum number of non-confusable strings evolving under short tandem duplications
• A Simple Lower Bound for the Capacity of the Deletion Channel
• On Lower Bounds for the Capacity of Deletion Channels
• Capacity Bounds for Sticky Channels

This page was built for publication: Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels

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