Abstract—A simple scheme was proposed by Knuth to generate balanced codewords from a random binary information sequence. However, this method presents a redundancy which is twice as that of the full sets of balanced codewords, that is the minimal achievable redundancy. The gap between the Knuth’s algorithm generated redundancy and the minimal one is significantly considerable and can be reduced. This paper attempts to achieve this goal through a method based on information sequence candidates.

 

Index Terms—Balanced code, inversion point, redundancy, running digital sum (RDS), running digital sum from left (RDSL), running digital sum from right (RDSR), information sequence candidates

Cite: Ebenezer Esenogho, Elie N. Mambou, and Hendrick C. Ferreira, “On the Improvement of the Knuth’s Redundancy Algorithm for Balancing Codes,”Journal of Communications vol. 14, no. 12, pp. 1147-1154, 2019. Doi: 10.12720/jcm.14.12.1147-1154