Knuth's Balanced Codes Revisited

@article{Weber2010KnuthsBC,
  title={Knuth's Balanced Codes Revisited},
  author={Jos H. Weber and Kees A. Schouhamer Immink},
  journal={IEEE Transactions on Information Theory},
  year={2010},
  volume={56},
  pages={1673-1679}
}
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. 
Highly Cited
This paper has 36 citations. REVIEW CITATIONS

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
19 Extracted Citations
6 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-10 of 19 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-6 of 6 references

Enumerative Combinatorics

  • R. P. Stanley
  • New York: Cambridge University Press, 1999, vol…
  • 1985
2 Excerpts

Similar Papers

Loading similar papers…