Knuth's Balanced Codes Revisited

In 1986, Don Knuth published a very simple algorithm for constructing sets of bipolar codewords with equal numbers of ¿1¿s and ¿-1¿s, called balanced codes. Knuth's algorithm is well suited for use with large codewords. The redundancy of Knuth's balanced codes is a factor of two larger than that of a code comprising the full set of balanced codewords. In this paper, we will present results of our attempts to improve the performance of Knuth's balanced codes.

[1]  Bella Bose,et al.  On balanced codes , 1990, IEEE Trans. Inf. Theory.

[2]  Donald E. Knuth,et al.  Efficient balanced codes , 1986, IEEE Trans. Inf. Theory.

[3]  R. Stanley.  What Is Enumerative Combinatorics , 1986 .

[4]  Noga Alon,et al.  Balancing sets of vectors , 1988, IEEE Trans. Inf. Theory.

[5]  Bella Bose,et al.  Design of some new Balanced Codes , 1993, Proceedings. IEEE International Symposium on Information Theory.

[6]  R. Stanley,et al.  Enumerative Combinatorics: Index , 1999 .

[7]  Bella Bose,et al.  Design of some new efficient balanced codes , 1996, IEEE Trans. Inf. Theory.

[8]  Schouhamer Immink,et al.  Codes for mass data storage systems , 2004 .