Prefixless q-ary balanced codes with ECC

Theo G. Swart, Kees A.S. Immink

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Citations (Scopus)

Abstract

We present a Knuth-like method for balancing q-ary codewords, which is characterized by the absence of a prefix that carries the information of the balancing index. Look-up tables for coding and decoding the prefix are avoided. We also show that this method can be extended to include error correction of single channel errors.

Original languageEnglish
Title of host publication2013 IEEE Information Theory Workshop, ITW 2013
DOIs
Publication statusPublished - 2013
Event2013 IEEE Information Theory Workshop, ITW 2013 - Seville, Spain
Duration: 9 Sept 201313 Sept 2013

Publication series

Name2013 IEEE Information Theory Workshop, ITW 2013

Conference

Conference2013 IEEE Information Theory Workshop, ITW 2013
Country/TerritorySpain
CitySeville
Period9/09/1313/09/13

ASJC Scopus subject areas

  • Information Systems

Fingerprint

Dive into the research topics of 'Prefixless q-ary balanced codes with ECC'. Together they form a unique fingerprint.

Cite this