论文信息 - The Grassl-R\"otteler cyclic and consta-cyclic MDS codes are generalised Reed-Solomon codes

The Grassl-R\"otteler cyclic and consta-cyclic MDS codes are generalised Reed-Solomon codes

We prove that the cyclic and constacyclic codes constructed by Grassl and Rötteler in [6] are generalised Reed-Solomon codes. This note can be considered as an addendum to Grassl and Rötteler [6]. It can also be considered as an appendix to Ball and Vilar [4], where Conjecture 11 of [6], which was stated for Grassl-Rötteler codes, is proven for generalised Reed-Solomon codes. The content of this note, together with [4], therefore implies that Conjecture 11 from [6] is true.

Simeon Ball

[1] Yuan Zhou. Introduction to Coding Theory , 2010 .

[3] Simeon Ball,et al. On sets of vectors of a finite vector space in which every subset of basis size is a basis II , 2012, Designs, Codes and Cryptography.

[4] Martin Rötteler,et al. Quantum MDS codes over small fields , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[5] David G. Glynn. The non-classical 10-arc of PG(4, 9) , 1986, Discret. Math..

[6] Simeon Ball,et al. Determining when a truncated generalised Reed-Solomon code is Hermitian self-orthogonal , 2021, ArXiv.

[7] B. Segre. Le geometrie di Galois , 1959 .