On Optimal k-Deletion Correcting Codes
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Transactions on Information Theory"
DOI: 10.1109/tit.2020.3028702
Abstract: Levenshtein introduced the problem of constructing k-deletion correcting codes in 1966, proved that the optimal redundancy of those codes is $ {O}(k~\log ~{N})$ for constant k, and proposed an optimal redundancy single-deletion correcting code (using… read more here.
Keywords: tex math; inline formula; deletion correcting; correcting codes ... See more keywords