Constacyclic codes with best-known parameters
arXiv:2511.0332375.8h-index: 1
AI Analysis
Provides new families of constacyclic codes with guaranteed distance bounds for coding theory researchers.
This paper constructs infinite families of q-ary constacyclic codes with length n, dimension around n/2, and minimum distance at least cn/log_q n, yielding many codes with optimal or best-known parameters.
In this paper, we construct several infinite families of $q$-ary constacyclic codes over a finite field $\mathbb{F}_q$ with length $n$, dimension around $n/2$, and minimum distance at least $cn/\log_q n$ for some positive constant $c$. They contain many constacyclic codes with optimal, or almost-optimal, or best-known parameters. We also consider constacyclic codes of various lengths.