Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2511.03323 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913169102864384 |
|---|---|
| author | Chen, Zekai Sha, Min |
| author_facet | Chen, Zekai Sha, Min |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_03323 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Constacyclic codes with best-known parameters Chen, Zekai Sha, Min Information Theory 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. |
| title | Constacyclic codes with best-known parameters |
| topic | Information Theory |
| url | https://arxiv.org/abs/2511.03323 |