• Please send your full manuscript to: jocm@vip.163.com

Binary Balanced Codes Approaching Capacity

Ebenezer Esenogho, Elie N. Mambou Theo G. Swart, and Hendrick C. Ferreira
Center for Telecommunication, Dept. of Electrical and Electronic Engineering Science, University of Johannesburg P. O. Box 524, Auckland Park, 2006, South Africa
Abstract—In this paper, the construction of binary balanced codes is revisited. Binary balanced codes refer to sets of bipolar codewords where the number of “1”s in each codeword equals that of “0”s. The first algorithm for balancing codes was proposed by Knuth in 1986; however, its redundancy is almost two times larger than that of the full set of balanced codewords. We will present an efficient and simple construction with a redundancy approaching the minimal achievable one

Index Terms—Balanced codes, redundancy, binary alphabet, parallel decoding scheme, Knuth’s scheme


Cite: Ebenezer Esenogho, Elie N. Mambou Theo G. Swart, and Hendrick C. Ferreira, “Binary Balanced Codes Approaching Capacity,”Journal of Communications vol. 14, no. 11, pp. 1104-1109, 2019. Doi: 10.12720/jcm.14.11.1104-1109.
Copyright © 2013-2019 Journal of Communications, All Rights Reserved
E-mail: jcm@etpub.com