Minimal linear codes in odd characteristic
Abstract
In this paper we generalize constructions in two recent works of Ding, Heng, Zhou to any field Fq, q odd, providing infinite families of minimal codes for which the Ashikhmin-Barg bound does not hold.
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.