Minimal linear codes in odd characteristic
arXiv:1811.06829
Abstract
In this paper we generalize constructions in two recent works of Ding, Heng, Zhou to any field , odd, providing infinite families of minimal codes for which the Ashikhmin-Barg bound does not hold.