Abstract :
A recent paper on polynomial codes[l] presented an important theorem concerning the BCH minimum-distance bound for the dual of a polynomial code. For a particular set of numerical examples, however, the theorem failed. This correspondence presents a modified version of the theorem that covers those cases and uses a method of proof, which, while rigorous, shows clearly the significance of certain concepts. The BCH bound on the minimum distance, however, remains the same.
