Efficient Systematic Encoding of Non-binary VT Codes
Information Theory
2018-04-30 v3 math.IT
Abstract
Varshamov-Tenengolts (VT) codes are a class of codes which can correct a single deletion or insertion with a linear-time decoder. This paper addresses the problem of efficient encoding of non-binary VT codes, defined over an alphabet of size . We propose a simple linear-time encoding method to systematically map binary message sequences onto VT codewords. The method provides a new lower bound on the size of -ary VT codes of length .
Keywords
Cite
@article{arxiv.1708.04071,
title = {Efficient Systematic Encoding of Non-binary VT Codes},
author = {Mahed Abroshan and Ramji Venkataramanan and Albert Guillen i Fabregas},
journal= {arXiv preprint arXiv:1708.04071},
year = {2018}
}
Comments
This paper will appear in the proceedings of ISIT 2018