By Topic

On balanced codes

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
$33 $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)
S. Al-Bassam ; Dept. of Comput. Sci., Oregon State Univ., Corvallis, OR, USA ; B. Bose

In a balanced code each codeword contains equally many 1's and 0's. Parallel decoding balanced codes with 2r (or 2r -1) information bits are presented, where r is the number of check bits. The 22-r-1 construction given by D.E. Knuth (ibid., vol.32, no.1, p.51-3, 1986) is improved. The new codes are shown to be optimal when Knuth's complementation method is used

Published in:

IEEE Transactions on Information Theory  (Volume:36 ,  Issue: 2 )