Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Bartoli et al. (2019) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: