Minimal linear codes in odd characteristic
classification
🧮 math.CO
cs.ITmath.IT
keywords
codesminimalashikhmin-bargboundcharacteristicconstructionsdingfamilies
read the original abstract
In this paper we generalize constructions in two recent works of Ding, Heng, Zhou to any field $\mathbb{F}_q$, $q$ odd, providing infinite families of minimal codes for which the Ashikhmin-Barg bound does not hold.
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.