Loading [a11y]/accessibility-menu.js
Construction of Efficient q-ary Balanced Codes | IEEE Conference Publication | IEEE Xplore

Construction of Efficient q-ary Balanced Codes


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...Show More

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.
Published in: 2019 IEEE AFRICON
Date of Conference: 25-27 September 2019
Date Added to IEEE Xplore: 07 July 2020
ISBN Information:

ISSN Information:

Conference Location: Accra, Ghana

Contact IEEE to Subscribe

References

References is not available for this document.