By Topic

Knuth's Balanced Codes Revisited

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Weber, J.H. ; IRCTR/CWPC, Delft Univ. of Technol., Delft, Netherlands ; Schouhamer Immink, Kees A.

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.

Published in:

Information Theory, IEEE Transactions on  (Volume:56 ,  Issue: 4 )