Metraipolis › archive › dc_d683efa34572
Quantum MDS codes from complements of unions of finite-field subsets — arXiv:2609.09943
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.09943
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T10:53:20.849Z
- SHA-256 of the archived text
4ed853c5efa1593b5e7fb77567eeb57b622bb7b9d172c9b2405f1c3ad7fbbee4- Stable URL of this page
https://metraipolis.com/documento/dc_d683efa34572
How to cite
Quantum MDS codes from complements of unions of finite-field subsets — arXiv:2609.09943 — arXiv (en), https://arxiv.org/abs/2609.09943 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d683efa34572 (Metraipolis archive dc_d683efa34572, sha256 4ed853c5efa1593b5e7fb77567eeb57b622bb7b9d172c9b2405f1c3ad7fbbee4)
BibTeX
@misc{dcd683efa34572,
title = {Quantum MDS codes from complements of unions of finite-field subsets — arXiv:2609.09943},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.09943},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d683efa34572; sha256 4ed853c5efa1593b5e7fb77567eeb57b622bb7b9d172c9b2405f1c3ad7fbbee4},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.09943. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $q$ be an odd prime power. We use complements of unions of subsets of $\mathbb F_{q^2}$ as locator sets and establish a sufficient condition under which a generalized Reed--Solomon (GRS) code is Hermitian self-orthogonal. Using cosets of multiplicative subgroups and sets with prescribed trace or norm values, we construct five families of Hermitian self-orthogonal GRS codes over $\mathbb F_{q^2}$. The Hermitian construction then yields five corresponding families of $q$-ary quantum maximum-distance-separable (MDS) codes. Under suitable parameter conditions, these quantum codes have minimum distances greater than $q/2+1$. By comparing codes of the same length, we give conditions under which our codes have strictly larger minimum distances than those obtainable from several previously known constructions based on trace maps, linear transformations, and cosets of multiplicative subgroups, either directly or via the propagation rule. We further show that such improvements occur for infinitely many values of $q$.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-10 in math.IT).
Categorie arXiv: Information Theory (cs.IT) ; Mathematical Physics (math-ph); Quantum Algebra (math.QA).
Pagina del lavoro: https://arxiv.org/abs/2609.09943 — 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-16T09:00:25.843Z dalla pagina https://arxiv.org/catchup/math.IT/2026-09-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).