2021/12/22 by Simeon Ball, Ball, Simeon · 2 citations
Computer Science · Engineering · Mathematics · #94B05 #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Computer and information sciences #FOS: Mathematics #Finite Group Theory Research #Information Theory (cs.IT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2112.11896
openalex publication_date 2021/12/22 · openalex created_date 2022/05/05 · openalex updated_date 2026/07/28
We prove that the cyclic and constacyclic codes constructed by Grassl and Rötteler in arXiv:1502.05267 are generalised Reed-Solomon codes. This note can be considered as an addendum to that article. It can also be considered as an appendix to arXiv:2106.10180, where Conjecture 11 of arXiv:1502.0526, which was stated for Grassl-Rötteler codes, is proven for generalised Reed-Solomon codes. The content of this note, together with arXiv:2106.10180, therefore implies that Conjecture 11 from arXiv:1502.0526 is true.