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

Theo G. Swart, Jos H. Weber, Kees A. Schouhamer Immink

Research output: Contribution to journalArticleScientificpeer-review

1 Citation (Scopus)
27 Downloads (Pure)


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.

Original languageEnglish
Pages (from-to)2431-2443
Number of pages13
JournalIEEE Transactions on Information Theory
Issue number4
Publication statusPublished - 2018

Bibliographical note

Accepted Author Manuscript


  • Balanced code
  • constrained code
  • error correction
  • Knuth code
  • running digital sum


Dive into the research topics of 'Prefixless q-ary Balanced Codes with Fast Syndrome-Based Error Correction'. Together they form a unique fingerprint.

Cite this