Skip to main content
Top
Published in: Designs, Codes and Cryptography 6/2020

26-02-2020

New MDS self-dual codes over finite fields of odd characteristic

Authors: Xiaolei Fang, Khawla Lebed, Hongwei Liu, Jinquan Luo

Published in: Designs, Codes and Cryptography | Issue 6/2020

Login to get access

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In this paper, we produce new classes of MDS self-dual codes via (extended) generalized Reed–Solomon codes over finite fields of odd characteristic. Among our constructions, there are many MDS self-dual codes with new parameters which have never been reported. When q is square of odd prime power, the total number of lengths of MDS self-dual codes over \(\mathbb {F}_q\) presented in this paper is much more than those in all the previous results.
Literature
1.
go back to reference Ball S.: On sets of vectors of a finite vector space in which every subset of basis size is a basis. J. Eur. Math. Soc. 14, 733–748 (2012).MathSciNetCrossRef Ball S.: On sets of vectors of a finite vector space in which every subset of basis size is a basis. J. Eur. Math. Soc. 14, 733–748 (2012).MathSciNetCrossRef
4.
go back to reference Bouyuklieva S., Willems W.: Singly even self-dual codes with minimal shadow. IEEE Trans. Inf. Theory 58(6), 3856–3860 (2012).MathSciNetCrossRef Bouyuklieva S., Willems W.: Singly even self-dual codes with minimal shadow. IEEE Trans. Inf. Theory 58(6), 3856–3860 (2012).MathSciNetCrossRef
5.
go back to reference Cramer R., Daza V., Gracia I., Urroz J.J., Leander G., Marti-Farre J., Padro C.: On codes, matroids and secure multi-party computation from linear secret sharing schemes. IEEE Trans. Inf. Theory 54(6), 2647–2657 (2008).CrossRef Cramer R., Daza V., Gracia I., Urroz J.J., Leander G., Marti-Farre J., Padro C.: On codes, matroids and secure multi-party computation from linear secret sharing schemes. IEEE Trans. Inf. Theory 54(6), 2647–2657 (2008).CrossRef
6.
go back to reference Dougherty S.T., Mesnager S., Solé P.: Secret-sharing schemes based on self-dual codes. In: Proc. Inf. Theory Workshop, pp. 338–342 (2008) Dougherty S.T., Mesnager S., Solé P.: Secret-sharing schemes based on self-dual codes. In: Proc. Inf. Theory Workshop, pp. 338–342 (2008)
7.
go back to reference Fang W., Fu F.: New constructions of MDS Euclidean self-dual codes from GRS codes and extended GRS codes. IEEE Trans. Inf. Theory 65(9), 5574–5579 (2019).MathSciNetCrossRef Fang W., Fu F.: New constructions of MDS Euclidean self-dual codes from GRS codes and extended GRS codes. IEEE Trans. Inf. Theory 65(9), 5574–5579 (2019).MathSciNetCrossRef
8.
go back to reference Georgion S., Koukouvinos C.: MDS self-dual codes over large prime fields. Finite Fields Appl. 8(4), 455–470 (2002).MathSciNetCrossRef Georgion S., Koukouvinos C.: MDS self-dual codes over large prime fields. Finite Fields Appl. 8(4), 455–470 (2002).MathSciNetCrossRef
9.
go back to reference Grassl, M., Gulliver, T.A.: On self-dual MDS codes. In: Proc. ISIT, 1954–1957 (2008) Grassl, M., Gulliver, T.A.: On self-dual MDS codes. In: Proc. ISIT, 1954–1957 (2008)
11.
go back to reference Gulliver T.A., Kim J.L., Lee Y.: New MDS or near-MDS self-dual codes. IEEE Trans. Inf. Theory 54(9), 4354–4360 (2008).MathSciNetCrossRef Gulliver T.A., Kim J.L., Lee Y.: New MDS or near-MDS self-dual codes. IEEE Trans. Inf. Theory 54(9), 4354–4360 (2008).MathSciNetCrossRef
12.
go back to reference Harada M., Kharaghani H.: Orthogonal designs, self-dual codes and the Leech lattice. J. Comb. Des. 13(3), 184–194 (2005).MathSciNetCrossRef Harada M., Kharaghani H.: Orthogonal designs, self-dual codes and the Leech lattice. J. Comb. Des. 13(3), 184–194 (2005).MathSciNetCrossRef
13.
go back to reference Harada M., Kharaghani H.: Orthogonal designs and MDS self-dual codes. Australas. J. Comb. 35, 57–67 (2006).MathSciNetMATH Harada M., Kharaghani H.: Orthogonal designs and MDS self-dual codes. Australas. J. Comb. 35, 57–67 (2006).MathSciNetMATH
14.
go back to reference Jin L., Xing C.: New MDS self-dual codes from generalized Reed–Solomon codes. IEEE Trans. Inf. Theory 63(3), 1434–1438 (2017).MathSciNetCrossRef Jin L., Xing C.: New MDS self-dual codes from generalized Reed–Solomon codes. IEEE Trans. Inf. Theory 63(3), 1434–1438 (2017).MathSciNetCrossRef
15.
go back to reference Kai X., Zhu S., Tang Y.: Some constacyclic self-dual codes over the integers modulo \(2^{m}\). Finite Fields Appl. 18(2), 258–270 (2012).MathSciNetCrossRef Kai X., Zhu S., Tang Y.: Some constacyclic self-dual codes over the integers modulo \(2^{m}\). Finite Fields Appl. 18(2), 258–270 (2012).MathSciNetCrossRef
16.
go back to reference Kim J.L., Lee Y.: MDS self-dual codes. In: Proc. of ISIT, 1872–1877 (2004) Kim J.L., Lee Y.: MDS self-dual codes. In: Proc. of ISIT, 1872–1877 (2004)
17.
go back to reference Kim J.L., Lee Y.: Euclidean and Hermitian self-dual MDS codes over large finite fields. J. Comb. Theory A 105(1), 79–95 (2004).MathSciNetCrossRef Kim J.L., Lee Y.: Euclidean and Hermitian self-dual MDS codes over large finite fields. J. Comb. Theory A 105(1), 79–95 (2004).MathSciNetCrossRef
18.
go back to reference Kokkala J.I., Krotov D.S., Östergärd P.R.J.: Classification of MDS codes over small alphabets. Coding Theory Appl. 3, 227–235 (2015).MathSciNetCrossRef Kokkala J.I., Krotov D.S., Östergärd P.R.J.: Classification of MDS codes over small alphabets. Coding Theory Appl. 3, 227–235 (2015).MathSciNetCrossRef
19.
go back to reference Lebed K., Liu H., Luo J.: Construction of MDS self-dual codes over finite fields. Finite Fields Appl. 59, 199–207 (2019).MathSciNetCrossRef Lebed K., Liu H., Luo J.: Construction of MDS self-dual codes over finite fields. Finite Fields Appl. 59, 199–207 (2019).MathSciNetCrossRef
20.
go back to reference MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North Holland, Amsterdam (1977).MATH MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North Holland, Amsterdam (1977).MATH
21.
go back to reference Massey J.: Some applications of coding theory in cryptography. In: Proc. 4th IMA Conf. Cryptogr. Coding, pp. 33–47 (1995) Massey J.: Some applications of coding theory in cryptography. In: Proc. 4th IMA Conf. Cryptogr. Coding, pp. 33–47 (1995)
23.
go back to reference Suh C., Ramchandran K.: Exact-repair MDS code construction using interference alignment. IEEE Trans. Inf. Theory 57(3), 1425–1442 (2011).MathSciNetCrossRef Suh C., Ramchandran K.: Exact-repair MDS code construction using interference alignment. IEEE Trans. Inf. Theory 57(3), 1425–1442 (2011).MathSciNetCrossRef
24.
go back to reference Tong H., Wang X.: New MDS Euclidean and Herimitian self-dual codes over finite fields. Adv. Pure Math. 7(5), 325–333 (2016).CrossRef Tong H., Wang X.: New MDS Euclidean and Herimitian self-dual codes over finite fields. Adv. Pure Math. 7(5), 325–333 (2016).CrossRef
26.
27.
Metadata
Title
New MDS self-dual codes over finite fields of odd characteristic
Authors
Xiaolei Fang
Khawla Lebed
Hongwei Liu
Jinquan Luo
Publication date
26-02-2020
Publisher
Springer US
Published in
Designs, Codes and Cryptography / Issue 6/2020
Print ISSN: 0925-1022
Electronic ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-020-00734-x

Other articles of this Issue 6/2020

Designs, Codes and Cryptography 6/2020 Go to the issue

OriginalPaper

All in the family

Premium Partner