Binary balanced codes approaching capacity

Ebenezer Esenogho; Elie Ngomseu Mambou; Theo G. Swart; Hendrick Christoffel Ferreira

doi:10.12720/jcm.14.11.1104-1109

Binary balanced codes approaching capacity

Ebenezer Esenogho, Elie Ngomseu Mambou, Theo G. Swart, Hendrick Christoffel Ferreira

Electrical and Electronic Engineering Science

University of Johannesburg

Research output: Contribution to journal › Article › peer-review

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.

Original language	English
Pages (from-to)	1104-1109
Number of pages	6
Journal	Journal of Communications
Volume	14
Issue number	11
DOIs	https://doi.org/10.12720/jcm.14.11.1104-1109
Publication status	Published - 2019

Keywords

Balanced codes
Binary alphabet
Knuth’s scheme
Parallel decoding scheme
Redundancy

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.12720/jcm.14.11.1104-1109

Cite this

@article{a26500bef5594912a4a4e3dcba362c76,

title = "Binary balanced codes approaching capacity",

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.",

keywords = "Balanced codes, Binary alphabet, Knuth{\textquoteright}s scheme, Parallel decoding scheme, Redundancy",

author = "Ebenezer Esenogho and Mambou, {Elie Ngomseu} and Swart, {Theo G.} and Ferreira, {Hendrick Christoffel}",

note = "Publisher Copyright: {\textcopyright} 2019 Journal of Communications.",

year = "2019",

doi = "10.12720/jcm.14.11.1104-1109",

language = "English",

volume = "14",

pages = "1104--1109",

journal = "Journal of Communications",

issn = "1796-2021",

publisher = "Engineering and Technology Publishing",

number = "11",

}

TY - JOUR

T1 - Binary balanced codes approaching capacity

AU - Esenogho, Ebenezer

AU - Mambou, Elie Ngomseu

AU - Swart, Theo G.

AU - Ferreira, Hendrick Christoffel

PY - 2019

Y1 - 2019

N2 - 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.

AB - 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.

KW - Balanced codes

KW - Binary alphabet

KW - Knuth’s scheme

KW - Parallel decoding scheme

KW - Redundancy

UR - http://www.scopus.com/inward/record.url?scp=85073552740&partnerID=8YFLogxK

U2 - 10.12720/jcm.14.11.1104-1109

DO - 10.12720/jcm.14.11.1104-1109

M3 - Article

AN - SCOPUS:85073552740

SN - 1796-2021

VL - 14

SP - 1104

EP - 1109

JO - Journal of Communications

JF - Journal of Communications

IS - 11

ER -

Binary balanced codes approaching capacity

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this