2019/11/13 by Aixian Zhang, Keqin Feng, Zhang, Aixian +1 · 2 citations
Computer Science · Engineering · #Coding theory and cryptography #Cooperative Communication and Network Coding #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1911.05234
openalex publication_date 2019/11/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
MDS self-dual codes over finite fields have attracted a lot of attention in recent years by their theoretical interests in coding theory and applications in cryptography and combinatorics. In this paper we present a series of MDS self-dual codes with new length by using generalized Reed-Solomon codes and extended generalized Reed-Solomon codes as the candidates of MDS codes and taking their evaluation sets as an union of cyclotomic classes. The conditions on such MDS codes being self-dual are expressed in terms of cyclotomic numbers.