Construction of Efficient q-ary Balanced Codes

Elie N. Mambou, Theo G. Swart

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

Abstract

Knuth proposed a simple scheme for balancing codewords, which was later extended for generating q-ary balanced codewords. The redundancy of existing schemes for balancing q-ary sequences is larger than that of the full balanced set which is the minimum achievable redundancy. In this article, we present a simple and efficient method to encode the prefix that results in less redundancy for the construction of q-ary balanced codewords.

Original languageEnglish
Title of host publicationIEEE AFRICON 2019
Subtitle of host publicationPowering Africa's Sustainable Energy for All Agenda: The Role of ICT and Engineering, AFRICON 2019
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781728132891
DOIs
Publication statusPublished - Sept 2019
Event2019 IEEE AFRICON, AFRICON 2019 - Accra, Ghana
Duration: 25 Sept 201927 Sept 2019

Publication series

NameIEEE AFRICON Conference
Volume2019-September
ISSN (Print)2153-0025
ISSN (Electronic)2153-0033

Conference

Conference2019 IEEE AFRICON, AFRICON 2019
Country/TerritoryGhana
CityAccra
Period25/09/1927/09/19

Keywords

  • Knuth's scheme
  • balanced codes
  • balancing point
  • parallel decoding scheme
  • q-ary alphabet
  • redundancy

ASJC Scopus subject areas

  • Computer Science Applications
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Construction of Efficient q-ary Balanced Codes'. Together they form a unique fingerprint.

Cite this