English

Determining when a truncated generalised Reed-Solomon code is Hermitian self-orthogonal

Information Theory 2021-12-24 v3 Combinatorics math.IT Quantum Physics

Abstract

We prove that there is a Hermitian self-orthogonal kk-dimensional truncated generalised Reed-Solomon code of length nq2n \leqslant q^2 over Fq2{\mathbb F}_{q^2} if and only if there is a polynomial gFq2g \in {\mathbb F}_{q^2} of degree at most (qk)q1(q-k)q-1 such that g+gqg+g^q has q2nq^2-n distinct zeros. This allows us to determine the smallest nn for which there is a Hermitian self-orthogonal kk-dimensional truncated generalised Reed-Solomon code of length nn over Fq2{\mathbb F}_{q^2}, verifying a conjecture of Grassl and R\"otteler. We also provide examples of Hermitian self-orthogonal kk-dimensional generalised Reed-Solomon codes of length q2+1q^2+1 over Fq2{\mathbb F}_{q^2}, for k=q1k=q-1 and qq an odd power of two.

Keywords

Cite

@article{arxiv.2106.10180,
  title  = {Determining when a truncated generalised Reed-Solomon code is Hermitian self-orthogonal},
  author = {Simeon Ball and Ricard Vilar},
  journal= {arXiv preprint arXiv:2106.10180},
  year   = {2021}
}
R2 v1 2026-06-24T03:21:56.818Z