DocumentCode
917708
Title
A new proof of the BCH bound (Corresp.)
Author
Chien, Robert T.
Volume
18
Issue
4
fYear
1972
fDate
7/1/1972 12:00:00 AM
Firstpage
541
Lastpage
541
Abstract
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.
Keywords
Cyclic codes; Algebra; Decoding; Geometry; Polynomials; Seismology;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1972.1054838
Filename
1054838
Link To Document