By Topic

A General Class of Maximal Codes ror Computer Applications

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)
Se June Hong ; Systems Products Division, IBM-Corporation ; Patel, Arvind M.

The error-correcting codes for symbols from GF (2b) are often used for correction of byte-errors in binary data. In these byte-error-correcting codes each check symbol in GF (2b) is expressed as b binary check digits and each information symbol in GF (2b), likewise, is expressed by b binary information digits. A new class of codes for single-byte-error correction is presented. The code is general in that the code structure does not depend on symbols from GF (2b). In particular, the number of check bits are not restricted to the multiples of b as in the case of the codes derived from GF (2b) codes. The new codes are either perfect or maximal and are easily implementable using shift registers.

Published in:

Computers, IEEE Transactions on  (Volume:C-21 ,  Issue: 12 )