Logo image
Sign in
Construction of efficient q-ary balanced  codes
Conference paper   Open access

Construction of efficient q-ary balanced codes

Mambou Elie N and Theo G Swart
2019
Handle:
https://hdl.handle.net/10210/406695

Abstract

Balanced codes Balancing point Reduncancy
Abstract : 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.
pdf
14813_Manuscript CE 2019.pdfDownloadView
Open Access

Metrics

25 Record Views

Details