Determining when a truncated generalised Reed-Solomon code is Hermitian self-orthogonal
Abstract
We prove that there is a Hermitian self-orthogonal k-dimensional truncated generalised Reed-Solomon code of length n ≤slant q2 over Fq2 if and only if there is a polynomial g ∈ Fq2 of degree at most (q-k)q-1 such that g+gq has q2-n distinct zeros. This allows us to determine the smallest n for which there is a Hermitian self-orthogonal k-dimensional truncated generalised Reed-Solomon code of length n over Fq2, verifying a conjecture of Grassl and R\"otteler. We also provide examples of Hermitian self-orthogonal k-dimensional generalised Reed-Solomon codes of length q2+1 over Fq2, for k=q-1 and q an odd power of two.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.