Efficient low-redundancy codes for correcting multiple deletions

DOI10.1137/1.9781611974331.CH132MaRDI QIDQ6829522zbMATH OpenFDO

Authors Joshua Brakensiek, Venkatesan Guruswami, Samuel Zbarsky

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05)

Cited in

(1)

• On the decoding error weight of one or two deletion channels

This page was built for publication: Efficient low-redundancy codes for correcting multiple deletions

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