Prefixless q-ary Balanced Codes with Fast Syndrome-Based Error Correction

Journal article (2018)

Authors

T.G. Swart University of Johannesburg
J.H. Weber Discrete Mathematics and Optimization - EEMCS
KA Schouhamer Immink Turing Machines Inc.
Research Group
Discrete Mathematics and Optimization (EEMCS) (TU Delft)
Copyright: © 2018 T.G. Swart, J.H. Weber, Kees A. Schouhamer Immink
DOI
help_outline
https://doi.org/10.1109/TIT.2017.2767034
Error correction Balanced code Constrained code Knuth code Running digital sum
More Info
expand_more

Published Date

2018

Language

English

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Delft Institute of Applied Mathematics

Research Group

Discrete Mathematics and Optimization

Abstract

We investigate a Knuth-like scheme for balancing q-ary code words, which has the virtue that lookup tables for coding and decoding the prefix are avoided by using precoding and error correction techniques. We show how the scheme can be extended to allow for error correction of single channel errors using a fast decoding algorithm that depends on syndromes only, making it considerably faster compared with the prior art exhaustive decoding strategy. A comparison between the new and prior art schemes, both in terms of redundancy and error performance, completes the study.