Skip to main content
Erschienen in: Cryptography and Communications 3/2022

24.11.2021

New constructions of self-dual generalized Reed-Solomon codes

verfasst von: Weijun Fang, Jun Zhang, Shu-Tao Xia, Fang-Wei Fu

Erschienen in: Cryptography and Communications | Ausgabe 3/2022

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

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 consists of a subgroup of finite fields and its cosets in a bigger subgroup. Four new families of MDS self-dual codes are then obtained. Moreover, by the Möbius action over finite fields, for any known self-dual GRS codes, we give a systematic way to construct new self-dual GRS codes with flexible evaluation points.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Baicheva, T., Bouyukliev, I., Dodunekov, S., Willems, W.: On the [10, 5, 6]9 Reed-Solomon and Glynn codes. Mathematica Balkanica New Series 67–78 (2004) Baicheva, T., Bouyukliev, I., Dodunekov, S., Willems, W.: On the [10, 5, 6]9 Reed-Solomon and Glynn codes. Mathematica Balkanica New Series 67–78 (2004)
2.
Zurück zum Zitat Balaji, S., Krishnan, M., Vajha, M., Ramkumar, V., Sasidharan, B., Kumar, P.: Erasure coding for distributed storage: An overview. Sci. China Inf. Sci. 61, 100301 (2018)CrossRef Balaji, S., Krishnan, M., Vajha, M., Ramkumar, V., Sasidharan, B., Kumar, P.: Erasure coding for distributed storage: An overview. Sci. China Inf. Sci. 61, 100301 (2018)CrossRef
3.
Zurück zum Zitat Beelen, P., Glynn, D., Høholdt, T., Kaipa, K.: Counting generalized Reed-Solomon codes. Adv. Math. Commun. 11(4), 777–790 (2017)MathSciNetCrossRef Beelen, P., Glynn, D., Høholdt, T., Kaipa, K.: Counting generalized Reed-Solomon codes. Adv. Math. Commun. 11(4), 777–790 (2017)MathSciNetCrossRef
4.
Zurück zum Zitat Betsumiya, K., Georgiou, S., Gulliver, T.A., Harada, M., Koukouvinos, C.: On self-dual codes over some prime fields. Discrete Math. 262(1-3), 37–58 (2003)MathSciNetCrossRef Betsumiya, K., Georgiou, S., Gulliver, T.A., Harada, M., Koukouvinos, C.: On self-dual codes over some prime fields. Discrete Math. 262(1-3), 37–58 (2003)MathSciNetCrossRef
5.
Zurück zum Zitat Conway, J.H., Sloane, N.J.A.: Sphere Packing, Lattices and Groups, 3rd edn. Springer, New York (1999)CrossRef Conway, J.H., Sloane, N.J.A.: Sphere Packing, Lattices and Groups, 3rd edn. Springer, New York (1999)CrossRef
6.
Zurück zum Zitat Cramer, R., Daza, V., Gracia, I., Urroz, J.J., Leander, G., Marti-Farre, J., Padro, C.: On codes, matroids and secure multiparty computation from linear secret sharing schemes. IEEE Trans. Inf. Theory 54(6), 2647–2657 (2008)MathSciNetCrossRef Cramer, R., Daza, V., Gracia, I., Urroz, J.J., Leander, G., Marti-Farre, J., Padro, C.: On codes, matroids and secure multiparty computation from linear secret sharing schemes. IEEE Trans. Inf. Theory 54(6), 2647–2657 (2008)MathSciNetCrossRef
7.
Zurück zum Zitat Dougherty, S.T., Mesnager, S., Solé, P.: Secret-sharing schemes based on self-dual codes. Proc. Inf. Theory Workshop 338–342 (2008) Dougherty, S.T., Mesnager, S., Solé, P.: Secret-sharing schemes based on self-dual codes. Proc. Inf. Theory Workshop 338–342 (2008)
8.
Zurück zum Zitat Fang, X., Lebed, K., Liu, H., Luo, J.: New MDS Euclidean self-dual codes over finite fields of odd characteristic. Des. Codes Cryptogr. 88, 1127–1138 (2020)MathSciNetCrossRef Fang, X., Lebed, K., Liu, H., Luo, J.: New MDS Euclidean self-dual codes over finite fields of odd characteristic. Des. Codes Cryptogr. 88, 1127–1138 (2020)MathSciNetCrossRef
9.
Zurück zum Zitat Fang, X., Liu, M., Luo, J.: New MDS Euclidean self-orthogonal codes. IEEE Trans. Inf. Theory 67(1), 130–137 (2021)MathSciNetCrossRef Fang, X., Liu, M., Luo, J.: New MDS Euclidean self-orthogonal codes. IEEE Trans. Inf. Theory 67(1), 130–137 (2021)MathSciNetCrossRef
10.
Zurück zum Zitat Fang, W., Fu, F.-W.: 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.-W.: 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
11.
Zurück zum Zitat Georgiou, S., Koukouvinos, C.: MDS Self-dual codes over large prime fields. Finite Fields Appl. 8(4), 455–470 (2002)MathSciNetCrossRef Georgiou, S., Koukouvinos, C.: MDS Self-dual codes over large prime fields. Finite Fields Appl. 8(4), 455–470 (2002)MathSciNetCrossRef
12.
Zurück zum Zitat Grassl, M., Gulliver, T.A.: On self-dual MDS codes. Proc. IEEE Int. Symp. Inf. Theory 1954–1957 (2008) Grassl, M., Gulliver, T.A.: On self-dual MDS codes. Proc. IEEE Int. Symp. Inf. Theory 1954–1957 (2008)
13.
14.
Zurück zum Zitat 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
15.
Zurück zum Zitat Harada, M., Kharaghani, H.: Orthogonal designs and MDS self-dual codes. Austral. J. Combin. 35, 57–67 (2006)MathSciNetMATH Harada, M., Kharaghani, H.: Orthogonal designs and MDS self-dual codes. Austral. J. Combin. 35, 57–67 (2006)MathSciNetMATH
16.
Zurück zum Zitat Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting codes. Cambridge Univ Press, UK (2003)CrossRef Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting codes. Cambridge Univ Press, UK (2003)CrossRef
17.
Zurück zum Zitat 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
18.
Zurück zum Zitat Kim, J.-L., Lee, Y.: Euclidean and Hermitian self-dual MDS codes over large finite fields. J. Combinat. 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. Combinat. Theory, A. 105(1), 79–95 (2004)MathSciNetCrossRef
19.
Zurück zum Zitat Lebed, K., Liu, H., Luo, J.: Construction of MDS Euclidean self-dual codes over finite field. Finite Fields Appl. 59, 199–207 (2019)MathSciNetCrossRef Lebed, K., Liu, H., Luo, J.: Construction of MDS Euclidean self-dual codes over finite field. Finite Fields Appl. 59, 199–207 (2019)MathSciNetCrossRef
20.
Zurück zum Zitat MacWilliams, F.J., Sloane, N.J.A.: The theory of Error-Correcting codes. Amsterdam the netherlands: North Holland (1977) MacWilliams, F.J., Sloane, N.J.A.: The theory of Error-Correcting codes. Amsterdam the netherlands: North Holland (1977)
22.
23.
Zurück zum Zitat Tong, H., Wang, X.: New MDS Euclidean and Hermitian self-dual codes over finite fields. Adv. in Pure Math. 7, 325–333 (2017)CrossRef Tong, H., Wang, X.: New MDS Euclidean and Hermitian self-dual codes over finite fields. Adv. in Pure Math. 7, 325–333 (2017)CrossRef
24.
Zurück zum Zitat Yang, Y., Cai, W.: On self-dual constacyclic codes over finite fields. Des. Codes Cryptogr. 74(2), 355–364 (2015)MathSciNetCrossRef Yang, Y., Cai, W.: On self-dual constacyclic codes over finite fields. Des. Codes Cryptogr. 74(2), 355–364 (2015)MathSciNetCrossRef
25.
26.
Zurück zum Zitat Zhang, A., Feng, K.: On the constructions of MDS self-dual codes via cyclotomy. arXiv:1911.05234. [cs.IT] (2019) Zhang, A., Feng, K.: On the constructions of MDS self-dual codes via cyclotomy. arXiv:1911.​05234. [cs.IT] (2019)
27.
Zurück zum Zitat Zhang, A., Feng, K.: A unified approach on constructing of MDS self-dual codes via Reed Solomon codes. IEEE Trans. Inf. Theory 66(6), 3650–3656 (2020)MathSciNetCrossRef Zhang, A., Feng, K.: A unified approach on constructing of MDS self-dual codes via Reed Solomon codes. IEEE Trans. Inf. Theory 66(6), 3650–3656 (2020)MathSciNetCrossRef
Metadaten
Titel
New constructions of self-dual generalized Reed-Solomon codes
verfasst von
Weijun Fang
Jun Zhang
Shu-Tao Xia
Fang-Wei Fu
Publikationsdatum
24.11.2021
Verlag
Springer US
Erschienen in
Cryptography and Communications / Ausgabe 3/2022
Print ISSN: 1936-2447
Elektronische ISSN: 1936-2455
DOI
https://doi.org/10.1007/s12095-021-00549-0

Weitere Artikel der Ausgabe 3/2022

Cryptography and Communications 3/2022 Zur Ausgabe