Codes Correcting Two Deletions
Information Theory
2018-05-02 v2 math.IT
Abstract
In this work, we investigate the problem of constructing codes capable of correcting two deletions. In particular, we construct a code that requires redundancy approximately 8 log n + O(log log n) bits of redundancy, where n is the length of the code. To the best of the author's knowledge, this represents the best known construction in that it requires the lowest number of redundant bits for a code correcting two deletions.
Keywords
Cite
@article{arxiv.1712.07222,
title = {Codes Correcting Two Deletions},
author = {Ryan Gabrys and Frederic Sala},
journal= {arXiv preprint arXiv:1712.07222},
year = {2018}
}