Every Bit Counts: A New Version of Non-binary VT Codes with More Efficient Encoder
Information Theory
2022-12-22 v1 Combinatorics
math.IT
Abstract
In this work, we present a new version of non-binary VT codes that are capable of correcting a single deletion or single insertion. Moreover, we provide the first known linear time algorithms that encode user messages into these codes of length n over the -ary alphabet for with at most redundant symbols, while the optimal redundancy required is at least symbols. Our designed encoder reduces the redundancy of the best-known encoder of Tenengolts (1984) by at least redundant symbols, or equivalently redundant bits.
Cite
@article{arxiv.2212.10721,
title = {Every Bit Counts: A New Version of Non-binary VT Codes with More Efficient Encoder},
author = {Tuan Thanh Nguyen and Kui Cai and Paul H. Siegel},
journal= {arXiv preprint arXiv:2212.10721},
year = {2022}
}