New MDS Self-Dual Codes From Generalized Reed—Solomon Codes

From MaRDI portal
Publication:5280841

DOI10.1109/TIT.2016.2645759zbMATH Open1366.94597arXiv1601.04467MaRDI QIDQ5280841FDOQ5280841


Authors: Lingfei Jin, Chaoping Xing Edit this on Wikidata


Publication date: 27 July 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Both MDS and Euclidean self-dual codes have theoretical and practical importance and the study of MDS self-dual codes has attracted lots of attention in recent years. In particular, determining existence of q-ary MDS self-dual codes for various lengths has been investigated extensively. The problem is completely solved for the case where q is even. The current paper focuses on the case where q is odd. We construct a few classes of new MDS self-dual code through generalized Reed-Solomon codes. More precisely, we show that for any given even length n we have a q-ary MDS code as long as and q is sufficiently large (say qge2nimesn2). Furthermore, we prove that there exists a q-ary MDS self-dual code of length n if q=r2 and n satisfies one of the three conditions: (i) nler and n is even; (ii) q is odd and n1 is an odd divisor of q1; (iii) requiv3mod4 and n=2tr for any tle(r1)/2.


Full work available at URL: https://arxiv.org/abs/1601.04467







Cited In (43)





This page was built for publication: New MDS Self-Dual Codes From Generalized Reed—Solomon Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280841)