By Topic

A new proof of the BCH bound (Corresp.)

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

1 Author(s)

A new proof has been found to establish the BCH bound, which relates the minimum distance of a cyclic code to the number of consecutive roots its generator polynomial possesses in a certain field. This new proof is recursive in nature and is very simple in structure. It makes no use of the Van der Monde determinant while it unifies the concepts of distance, estimation, and decoding.

Published in:

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