scientific article; zbMATH DE number 3873229

From MaRDI portal
Publication:3340770





[For the entire collection see Zbl 0523.00001.] The author obtains a lower bound for the weight of a polynomial in terms of its set of roots. This bound is shown to be better for several examples of cyclic codes. This bound implies the BCH- and HT-bounds.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340770)