An improvement of the Feng-Rao bound for primary codes
classification
💻 cs.IT
math.ACmath.IT
keywords
boundcodesprimarydistancefeng-raogeneralisedminimumaffine
read the original abstract
We present a new bound for the minimum distance of a general primary linear code. For affine variety codes defined from generalised C_{ab} curves the new bound often improves dramatically on the Feng-Rao bound for primary codes. The method does not only work for the minimum distance but can be applied to any generalised Hamming weight
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.