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 leqslant q^2 over {mathbb F}_{q^2} if and only if there is a polynomial g mathbb F_{q^2} of degree at most (q-k)q-1 such that g+g^q has q^2-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 {mathbb F}_{q^2}, verifying a conjecture of Grassl and Rötteler. We also provide examples of Hermitian self-orthogonal k-dimensional generalised Reed-Solomon codes of length q^2+1 over {mathbb F}_{q^2}, for k=q-1 and q an odd power of two.
Get this paper in your agent:
hf papers read 2106.10180 Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash Models citing this paper 0
No model linking this paper
Datasets citing this paper 0
No dataset linking this paper
Spaces citing this paper 0
No Space linking this paper
Collections including this paper 0
No Collection including this paper