An improvement of the Feng-Rao bound for primary codes
Abstract
We present a new bound for the minimum distance of a general primary linear code. For affine variety codes defined from generalised Cab 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
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.