By Topic

Single-error-correcting codes for constant-weight data words

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)

A family of single-error-correcting codes is described for the protection of binary data words of fixed length k , each of which has the same number w of 1 's. The code family is shown to be valid for all integers k and w (where 0 < w < k) . Some other related codes, based upon conventional Hamming codes, Latin squares, and block designs are also developed, and some of these are more efficient for certain values of w and k .

Published in:

IEEE Transactions on Information Theory  (Volume:11 ,  Issue: 1 )