An improved bound on the fraction of correctable deletions

DOI10.1137/1.9781611974331.CH133MaRDI QIDQ4575717zbMATH OpenOpenAlexFDO

Authors Boris Bukh, Venkatesan Guruswami

Publication date 16 July 2018

Published in Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611974331.ch133

Mathematics Subject Classification ID

Combinatorial codes (94B25) Bounds on codes (94B65)

Recommendations

• Deletion codes in the high-noise and high-rate regimes
• Efficiently decodable codes for the binary deletion channel
• scientific article; zbMATH DE number 5302391
• Coding against deletions in oblivious and online models

Cited in

(11)

• Feedback insertion-deletion codes
• Real-time error correction codes for deletable errors
• A number theoretic formula and asymptotic optimality of cardinalities of BAD correcting codes
• scientific article; zbMATH DE number 2127884 (Why is no real title available?)
• Polynomial Time Low-Density Parity-Check Codes With Rates Very Close to the Capacity of the q-ary Random Deletion Channel for Large q
• Coding against deletions in oblivious and online models
• Efficiently decodable codes for the binary deletion channel
• Deletion-correcting codes and dominant vectors
• Deletion codes in the high-noise and high-rate regimes
• The decodability and correctability of codes
• Deterministic document exchange protocols and almost optimal binary codes for edit errors

This page was built for publication: An improved bound on the fraction of correctable deletions

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