Journal
IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 65, Issue 2, Pages 965-974Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2018.2876281
Keywords
Codes; error-correction codes
Funding
- NISE Program at SSC Pacific
Ask authors/readers for more resources
In this paper, we investigate the problem of constructing codes capable of correcting two deletions. In particular, we construct a code that requires redundancy approximately 8 log(2) n + O(log(2) log(2) n) bits of redundancy, where n denotes the length of the code. To the best of the authors' knowledge, this represents the best known construction in that it requires the lowest number of redundant bits for a code correcting two deletions.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available