Optimal Coding for the Binary Deletion Channel With Small Deletion Probability

DOI10.1109/TIT.2013.2262020MaRDI QIDQ5346282zbMATH OpenFDO

Authors Yashodhan Kanoria, Andrea Montanari

Publication date 8 June 2017

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

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

Mathematics Subject Classification ID

Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Efficiently decodable codes for the binary deletion channel
• Novel Bounds on the Capacity of the Binary Deletion Channel
• On Optimal k-Deletion Correcting Codes
• Polynomial Time Decodable Codes for the Binary Deletion Channel
• Improved Constructions of Coding Schemes for the Binary Deletion Channel and the Poisson Repeat Channel
• Optimal Ultrasmall Block-Codes for Binary Discrete Memoryless Channels
• Deletion Codes in the High-Noise and High-Rate Regimes
• Deletion codes in the high-noise and high-rate regimes
• scientific article; zbMATH DE number 3361766
• Polar Coding for Channels With Deletions

Cited in

(2)

• Polynomial Time Decodable Codes for the Binary Deletion Channel
• Information-Theoretic Foundations of DNA Data Storage

This page was built for publication: Optimal Coding for the Binary Deletion Channel With Small Deletion Probability

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