A Note on Self-Dual Generalized Reed-Solomon Codes

A linear code is called an MDS self-dual code if it is both an MDS code and a self-dual code with respect to the Euclidean inner product. The parameters of such codes are completely determined by the code length. In this paper, we consider new constructions of MDS self-dual codes via generalized Reed-Solomon (GRS) codes and their extended codes. The critical idea of our constructions is to choose suitable evaluation points such that the corresponding (extended) GRS codes are self-dual. The evaluation set of our constructions is consists of a subgroup of finite fields and its cosets in a bigger subgroup. Four new families of MDS self-dual codes are obtained and they have better parameters than previous results in certain region. Moreover, by the Mobius action over finite fields, we give a systematic way to construct self-dual GRS codes with different evaluation points provided any known self-dual GRS codes. Specially, we prove that all the self-dual extended GRS codes over $\mathbb{F}_{q}$ with length $n< q+1$ can be constructed from GRS codes with the same parameters.

[1]  Lin Sok.  Explicit Constructions of MDS Self-Dual Codes , 2020, IEEE Transactions on Information Theory.

[2]  François Sigrist.  Sphere packing , 1983 .

[3]  Markus Grassl,et al.  On self-dual MDS codes , 2008, 2008 IEEE International Symposium on Information Theory.

[4]  Aixian Zhang,et al.  On the Constructions of MDS Self-dual Codes via Cyclotomy , 2019, ArXiv.

[5]  Chaoping Xing,et al.  New MDS Self-Dual Codes From Generalized Reed—Solomon Codes , 2016, IEEE Transactions on Information Theory.

[6]  Peter Beelen,et al.  Counting generalized Reed-Solomon codes , 2016, Adv. Math. Commun..

[7]  Masaaki Harada,et al.  On self-dual codes over some prime fields , 2003, Discret. Math..

[8]  Masaaki Harada,et al.  Orthogonal designs and MDS self-dual codes , 2006, Australas. J Comb..

[9]  Jon-Lark Kim,et al.  Euclidean and Hermitian self-dual MDS codes over large finite fields , 2004, J. Comb. Theory, Ser. A.

[10]  Balaji Srinivasan Babu,et al.  Erasure coding for distributed storage: an overview , 2018, Science China Information Sciences.

[11]  Fang-Wei Fu,et al.  New Constructions of MDS Euclidean Self-Dual Codes From GRS Codes and Extended GRS Codes , 2019, IEEE Transactions on Information Theory.

[12]  Wenchao Cai,et al.  On self-dual constacyclic codes over finite fields , 2015, Des. Codes Cryptogr..

[13]  Jon-Lark Kim,et al.  New MDS or Near-MDS Self-Dual Codes , 2008, IEEE Transactions on Information Theory.

[14]  Haode Yan.  A note on the constructions of MDS self-dual codes , 2018, Cryptography and Communications.

[15]  Keqin Feng,et al.  An Unified Approach on Constructing of MDS Self-dual Codes via Reed-Solomon Codes , 2019, ArXiv.

[16]  Kenza Guenda.  New MDS self-dual codes over finite fields , 2012, Des. Codes Cryptogr..

[17]  Xiaoqing Wang,et al.  New MDS Euclidean and Hermitian self-dual codes over finite fields , 2016, ArXiv.

[18]  Jinquan Luo,et al.  New MDS Euclidean Self-Orthogonal Codes , 2021, IEEE Transactions on Information Theory.

[19]  Carles Padró,et al.  On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes , 2005, IEEE Transactions on Information Theory.

[20]  Sihem Mesnager,et al.  Secret-sharing schemes based on self-dual codes , 2008, 2008 IEEE Information Theory Workshop.

[21]  S. Georgiou,et al.  MDS Self-Dual Codes over Large Prime Fields , 2002 .

[22]  V. Pless.  On the uniqueness of the Golay codes , 1968 .

[23]  W. Cary Huffman,et al.  Fundamentals of Error-Correcting Codes , 1975 .

[24]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[25]  Jinquan Luo,et al.  New MDS self-dual codes over finite fields of odd characteristic , 2020, Des. Codes Cryptogr..