By Topic

Augmentation techniques for a class of product 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
$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

1 Author(s)

A class of product codes for which an augmented syndrome can be defined is studied. By using this augmented syndrome, we are able to add new codewords to a product code while keeping the minimum distance fixed. In many cases the resulting code is as good as any known code. Decoders that may be simpler to implement than existing decoders are described for these augmented codes. It is also seen that in certain cases, by choosing not to correct a small number of correctable errors, significant simplifications in the decoder can be achieved. Finally, this augmentation technique is used in an example to generate a code of length 32 and minimum distance 8 with more codewords than any code previously known.

Published in:

Information Theory, IEEE Transactions on  (Volume:19 ,  Issue: 5 )