Capacity Bounds for Sticky Channels

DOI10.1109/TIT.2007.911291MaRDI QIDQ3604462zbMATH OpenOpenAlexFDO

Authors Michael Mitzenmacher

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.2007.911291

zbMATH Keywords

Capacity boundsduplication channelsinsertion/deletion channelssticky channels

Mathematics Subject Classification ID

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

Recommendations

• Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels
• Capacity bounds for a channel with synchronization errors
• A Simple Lower Bound for the Capacity of the Deletion Channel
• Capacity Upper Bounds for Deletion-type Channels
• Capacity upper bounds for deletion-type channels

Cited in

(3)

• Capacity bounds for a channel with synchronization errors
• Improved Lower Bounds for the Capacity of i.i.d. Deletion and Duplication Channels
• Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels

This page was built for publication: Capacity Bounds for Sticky Channels

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