CUED Publications database

Efficient Systematic Encoding of Non-binary VT Codes

Abroshan, M and Venkataramanan, R and Fabregas, AGI Efficient Systematic Encoding of Non-binary VT Codes. (Unpublished)

Full text not available from this repository.


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 $q >2$. 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 $q$-ary VT codes of length $n$.

Item Type: Article
Uncontrolled Keywords: cs.IT cs.IT math.IT
Divisions: Div F > Signal Processing and Communications
Depositing User: Cron Job
Date Deposited: 24 Aug 2017 01:23
Last Modified: 22 May 2018 06:50