Efficient Systematic Encoding of Non-binary VT Codes
From MaRDI portal
Publication:6290076
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 .
This page was built for publication: Efficient Systematic Encoding of Non-binary VT Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6290076)
