In 1986, Don Knuth published a very simple algorithm for constructing sets of bipolar codewords with equal numbers of dasia1psilas and dasia-1psilas, called balanced codes. Knuthpsilas algorithm is, since look-up tables are absent, well suited for use with large codewords. The redundancy of Knuthpsilas balanced codes is a factor of two larger than that of a code comprising the full set of balanced codewords. In our paper we will present results of our attempts to improve the performance of Knuthpsilas balanced codes.
['Jos H. Weber', 'K.A. Schouhamer Immink']
Knuth’s balancing of codewords revisited