Metraipolis › archive › dc_63e28125eace
Minimum distances of primitive narrow-sense BCH codes via good zero-sets — arXiv:2609.21994
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.21994
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-10T02:20:08.999Z
- SHA-256 of the archived text
1b2a70ef674e8a42567908e03c739e93fcb1ad9925c6f30af97f7dcc1c379599- Stable URL of this page
https://metraipolis.com/documento/dc_63e28125eace
How to cite
Minimum distances of primitive narrow-sense BCH codes via good zero-sets — arXiv:2609.21994 — arXiv (en), https://arxiv.org/abs/2609.21994 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_63e28125eace (Metraipolis archive dc_63e28125eace, sha256 1b2a70ef674e8a42567908e03c739e93fcb1ad9925c6f30af97f7dcc1c379599)
BibTeX
@misc{dc63e28125eace,
title = {Minimum distances of primitive narrow-sense BCH codes via good zero-sets — arXiv:2609.21994},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.21994},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_63e28125eace; sha256 1b2a70ef674e8a42567908e03c739e93fcb1ad9925c6f30af97f7dcc1c379599},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.21994. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Determining the exact minimum distances of BCH codes remains a open problem. We establish the minimum distances of several families of primitive narrow-sense BCH codes, showing that they attain their designed distances. Our approach centers on $\mathbb{F}_q$-good zero-sets, which we introduce through a derivative condition on their vanishing polynomials. We show that a $q$-ary primitive narrow-sense BCH code of length $q^m-1$ and designed distance $2\leq\delta\leq q^m-1$ has minimum distance $\delta$ if and only if there exists an $\mathbb{F}_q$-good zero-set of cardinality $\delta+1$ in the finite field $\mathbb{F}_{q^m}$ with $q^m$ elements. To construct $\mathbb{F}_q$-good zero-sets, we develop several methods based on polynomial substitutions, power maps, and shifted inverses, as well as direct constructions using polynomials of special forms. Together with suitable initial $\mathbb{F}_q$-good zero-sets, including those arising from known minimum-distance results, these methods yield new good zero-sets of various cardinalities and hence families of primitive narrow-sense BCH codes whose minimum distances equal their designed distances. These families cover a broad range of designed distances, with several known minimum-distance results recovered as special cases.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-21 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.21994 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T02:04:28.751Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).