Skip to content
DraconiticResearch
Search Sources API
194,161 studies31 sourcesUpdated 51 min ago
PreprintCC BY 4.0arXiv

Quantum MDS codes from complements of unions of finite-field subsets

Abstract

Let q be an odd prime power. We use complements of unions of subsets of 𝔽q2 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 𝔽q2. 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.

Related

  1. Rate-2/3 Girth-8 (3,18)-Regular Quantum LDPC Codes from Two-Branch Finite-Field Bases and CPM Lifts
    Koki Okada, Kenta Kasai
    arXivPreprintarXiv licenceFull textGeneral mathematicsQuantum physics & quantum informationarXiv
  2. Perturbed Exponential Systems, Pattern-Dependent Shifted-Sinc Operators, and Matrix Symbols on Finite Unions of Intervals
    Pierluigi Vellucci, Gohin Shaikh Samad
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  3. Finite groups with large power-avoiding subsets
    Simon R. Blackburn, Sarah B. Hart, Daniel McVeagh
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
  4. Continuity of Magnitude at Finite Subsets of ℓ1N
    Sara Kališnik, Davorin Lešnik
    arXivPreprintarXiv licenceFull textGeometry & topologyarXiv
  5. Arithmetic progressions in dense subsets of primitive elements of finite fields
    Hai-Liang Wu
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryCombinatorics & discrete mathematicsarXiv
BibTeX
@misc{hu2026quantum,
  title = {{Quantum MDS codes from complements of unions of finite-field subsets}},
  author = {Naihong Hu and Hong Ji},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.09943},
  eprint = {2609.09943},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.09943},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Quantum MDS codes from complements of unions of finite-field subsets
AU  - Naihong Hu
AU  - Hong Ji
PY  - 2026
DA  - 2026/09/09
PB  - arXiv
DO  - 10.48550/arxiv.2609.09943
UR  - https://arxiv.org/abs/2609.09943
AB  - Let q be an odd prime power. We use complements of unions of subsets of 𝔽_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 𝔽_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.
ER  -