🔮
🔮
The Ethereal
Minimal linear codes in odd characteristic
November 16, 2018 · The Ethereal · 🏛 IEEE Transactions on Information Theory
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Daniele Bartoli, Matteo Bonini
arXiv ID
1811.06829
Category
math.CO: Combinatorics
Cross-listed
cs.IT
Citations
57
Venue
IEEE Transactions on Information Theory
Last Checked
1 month ago
Abstract
In this paper we generalize constructions in two recent works of Ding, Heng, Zhou to any field $\mathbb{F}_q$, $q$ odd, providing infinite families of minimal codes for which the Ashikhmin-Barg bound does not hold.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Combinatorics
🔮
🔮
The Ethereal
On cap sets and the group-theoretic approach to matrix multiplication
🔮
🔮
The Ethereal
Generalized Twisted Gabidulin Codes
🔮
🔮
The Ethereal
Tables of subspace codes
🔮
🔮
The Ethereal
Classification of weighted networks through mesoscale homological features
🔮
🔮
The Ethereal