Metraipolis › archive › dc_cf7634d90adc

Geometric Obstructions and Sharp Genus Dependence in LCD Scalings — arXiv:2611.04863

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.04863
License (as archived)
CC0-1.0
Archived
2026-11-04T12:49:19.398Z
SHA-256 of the archived text
dd29f67e668b65cf2d055eb88e2c486aaf1cbfb780104ecb0a85d30d1c66fd4e
Stable URL of this page
https://metraipolis.com/documento/dc_cf7634d90adc

How to cite

Geometric Obstructions and Sharp Genus Dependence in LCD Scalings — arXiv:2611.04863 — arXiv (en), https://arxiv.org/abs/2611.04863 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cf7634d90adc (Metraipolis archive dc_cf7634d90adc, sha256 dd29f67e668b65cf2d055eb88e2c486aaf1cbfb780104ecb0a85d30d1c66fd4e)
BibTeX
@misc{dccf7634d90adc,
  title = {Geometric Obstructions and Sharp Genus Dependence in LCD Scalings — arXiv:2611.04863},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04863},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cf7634d90adc; sha256 dd29f67e668b65cf2d055eb88e2c486aaf1cbfb780104ecb0a85d30d1c66fd4e},
  year = {2026}
}

Archived text

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

We study the least pole order of a rational function whose nonzero evaluations scale a prescribed code to a Euclidean LCD code. A residue-one differential yields an obstruction for odd-dimensional one-point AG codes in characteristic two: for $C=C_L(D,aQ)$ with $0\le a<n$ and odd dimension, the threshold is at least $n+2g-a-1$. The obstruction uses alternating Gram matrices and does not require the scaled code to be self-orthogonal. For the dimension-three codes $C_L(D,(r+1)Q)$ on Hermitian curves over $\F_{r^2}$, $r=2^e\ge4$, we obtain \[ n+2g-r-2\le\tau_D(C;Q)\le n+2g-3. \] Consequently the leading genus contribution is asymptotically sharp even in dimension three. On the elliptic curve $y^2+y=x^3$ over $\F_4$, we prove the exact dimension-three threshold $6$ by an explicit multiplier. For repetition codes on the Hermitian family, the threshold equals the general interpolation bound $n+2g-1$. The upper bounds use information sets and hold for $q>3k$, and for $q>2k$ in characteristic two.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Algebraic Geometry (math.AG) ; Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2611.04863 — 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-11-04T12:32:47.128Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).