Metraipolis › archive › dc_372ce6221ecf

Generalized Hamming weights of codes arising from complete intersection — arXiv:2608.19978

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.19978
License (as archived)
CC0-1.0
Archived
2026-10-18T12:00:45.113Z
SHA-256 of the archived text
aa6a9b96f3863dcd68ced231c5bc3c2c8612dd23082ee6c8bda8c4791aa6aee4
Stable URL of this page
https://metraipolis.com/documento/dc_372ce6221ecf

How to cite

Generalized Hamming weights of codes arising from complete intersection — arXiv:2608.19978 — arXiv (en), https://arxiv.org/abs/2608.19978 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_372ce6221ecf (Metraipolis archive dc_372ce6221ecf, sha256 aa6a9b96f3863dcd68ced231c5bc3c2c8612dd23082ee6c8bda8c4791aa6aee4)
BibTeX
@misc{dc372ce6221ecf,
  title = {Generalized Hamming weights of codes arising from complete intersection — arXiv:2608.19978},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.19978},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_372ce6221ecf; sha256 aa6a9b96f3863dcd68ced231c5bc3c2c8612dd23082ee6c8bda8c4791aa6aee4},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.19978. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We provide a positive answer to a conjecture proposed by Tohǎneanu and Van Tuyl regarding the minimum distance of codes whose underlying set of points is a reduced complete intersection. Despite the technical nature of the conjecture, we show that it follows directly from a not-well-known refinement of the classical Bézout bound for overdetermined polynomial systems. For completeness, this paper presents a self-contained proof of this refined bound. Furthermore, we show that using the same approach, it is possible to obtain a bound on the generalized Hamming weights of such a code and, more generally, to control the minimum distance of the codes obtained by evaluating forms of degree $d$ on the points of a zero-dimensional complete intersection.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-21 in math.IT).
Categorie arXiv: Commutative Algebra (math.AC) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2608.19978 — 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-18T11:58:25.133Z dalla pagina https://arxiv.org/catchup/math.IT/2026-08-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).