A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
An Improved Bound on the Fraction of Correctable Deletions
IEEE Transactions on Information Theory
We consider codes over fixed alphabets against worst-case symbol deletions. For any fixed k 2, we construct a family of codes over alphabet of size k with positive rate, which allow efficient recovery from a worst-case deletion fraction approaching 1 − 2 k+1 . In particular, for binary codes, we are able to recover a fraction of deletions approaching 1/3. Previously, even non-constructively the largest deletion fraction known to be correctable with positive rate was 1 − Θ(1/ √ k), and arounddoi:10.1109/tit.2016.2621044 fatcat:q32omapj5zdg7fyx2ep7iewvsy