Litcius/Paper detail

A Unified Approach to Construct MDS Self-Dual Codes via Reed-Solomon Codes

Aixian Zhang, Keqin Feng

2020IEEE Transactions on Information Theory50 citationsDOI

Abstract

MDS codes and self-dual codes are important families of classical codes in coding theory. Therefore, it is of interest to investigate MDS self-dual codes. The existence of MDS selfdual codes over finite field F <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">q</sub> is completely solved for q is even. In the literature, there are many known constructions of MDS self-dual codes for q is odd. In this paper, we present a unified approach on the existence of MDS self-dual codes with concise statements and simplified proof. It is illustrated that some of known results can also be stated in this framework. Furthermore, we can obtain some new MDS self-dual codes, especially for the case when q is not a square.

Topics & Concepts

Dual (grammatical number)Finite fieldBlock codeCoding theoryComputer scienceGroup codeDiscrete mathematicsConstruct (python library)Reed–Muller codeCoding (social sciences)Combinatorial designMathematicsLinear codeTheoretical computer scienceAlgorithmDecoding methodsProgramming languageArtStatisticsLiteratureCoding theory and cryptographygraph theory and CDMA systemsCooperative Communication and Network Coding