Construction of MDS Self-dual Codes over Finite Fields

2018/07/27 by Khawla Labad, Labad, Khawla, Honwei Liu +3 · 4 citations
Computer Science · Engineering · #Coding theory and cryptography #Cooperative Communication and Network Coding #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1807.10625

Abstract

In this paper, we obtain some new results on the existence of MDS self-dual codes utilizing (extended) generalized Reed-Solomon codes over finite fields of odd characteristic. For some fixed q, our results can produce more classes of MDS self-dual codes than previous works.

Cited by

• On induced subgraphs with degree parity conditions in Paley graphs and Paley tournaments
• New Constructions of Non-GRS MDS Codes, Recovery and Determination Algorithms for GRS Codes
• An Unified Approach on Constructing of MDS Self-dual Codes via Reed-Solomon Codes
• Column Twisted Reed-Solomon Codes as MDS Codes

Related

• Construction of MDS self-dual codes from generalized Reed-Solomon codes
• New MDS Self-dual Codes over Finite Fields of Odd Characteristic
• An Unified Approach on Constructing of MDS Self-dual Codes via Reed-Solomon Codes
• A Note on Self-Dual Generalized Reed-Solomon Codes
• New MDS Self-Dual Codes over Large Finite Fields