English

Minimal linear codes in odd characteristic

Combinatorics 2018-11-21 v1 Information Theory math.IT

Abstract

In this paper we generalize constructions in two recent works of Ding, Heng, Zhou to any field Fq\mathbb{F}_q, qq odd, providing infinite families of minimal codes for which the Ashikhmin-Barg bound does not hold.

Keywords

Cite

@article{arxiv.1811.06829,
  title  = {Minimal linear codes in odd characteristic},
  author = {Daniele Bartoli and Matteo Bonini},
  journal= {arXiv preprint arXiv:1811.06829},
  year   = {2018}
}
R2 v1 2026-06-23T05:18:11.118Z