Minimal Linear Codes in Odd Characteristic
Daniele Bartoli, Matteo Bonini · IEEE Transactions on Information Theory · 2019
In this paper, we generalize constructions in two recent works of Ding, Heng, and Zhou to any field Fq, q odd, providing infinite families of minimal codes for which the Ashikhmin-Barg bound does not hold.