Combinatorics

Discrete mathematics

Pure mathematics

Mathematics

Finite field

Mathematical analysis

Computer science

Field (mathematics)

Upper and lower bounds

IEEE Transactions on Information Theory

In this paper, we generalize constructions in two recent works of Ding, Heng, and Zhou to any field F <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">q</sub> , q odd, providing infinite families of minimal codes for which the Ashikhmin-Barg bound does not hold.

Minimal Linear Codes in Odd Characteristic