Metraipolis › archive › dc_17cdb1374745
The generalized Griesmer and antiGriesmer bounds — arXiv:2608.04495
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.04495
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-31T11:46:00.269Z
- SHA-256 of the archived text
b98f5ce05cf31eb3901fba8787fa0f5c6c90a27765a1675b53d3d5bf39ff1c89- Stable URL of this page
https://metraipolis.com/documento/dc_17cdb1374745
How to cite
The generalized Griesmer and antiGriesmer bounds — arXiv:2608.04495 — arXiv (en), https://arxiv.org/abs/2608.04495 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_17cdb1374745 (Metraipolis archive dc_17cdb1374745, sha256 b98f5ce05cf31eb3901fba8787fa0f5c6c90a27765a1675b53d3d5bf39ff1c89)
BibTeX
@misc{dc17cdb1374745,
title = {The generalized Griesmer and antiGriesmer bounds — arXiv:2608.04495},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.04495},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_17cdb1374745; sha256 b98f5ce05cf31eb3901fba8787fa0f5c6c90a27765a1675b53d3d5bf39ff1c89},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.04495. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We present three proofs of the generalized Griesmer bound together with the corresponding proofs of the generalized antiGriesmer bound. The first proof follows from inequalities relating consecutive minimum and maximum subcode support weights. We also write the projective construction of Tsfasman and Vlăduţ as a residual code argument and express the geometric proof of Kurz, Landjev, and Rousseva in terms of shortened subcodes. In addition, complements in repeated simplex codes show that the two bounds are equivalent. The residual and shortening arguments also determine the consequences of equality for the resulting residual codes and shortened subcodes. Finally, the complement relation transfers known divisibility results for Griesmer codes to antiGriesmer codes. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-06 in math.CO). Categorie arXiv: Combinatorics (math.CO) ; Information Theory (cs.IT). Pagina del lavoro: https://arxiv.org/abs/2608.04495 — 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-31T11:35:10.102Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-06?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).