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.
