Skip to main content
Erschienen in: Designs, Codes and Cryptography 6/2019

24.07.2018

The extension theorem for Lee and Euclidean weight codes over integer residue rings

verfasst von: Serhii Dyshko

Erschienen in: Designs, Codes and Cryptography | Ausgabe 6/2019

Einloggen, um Zugang zu erhalten

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

search-config
loading …

Abstract

The extension theorem is proved for the Lee and Euclidean weights over the integer residue ring \(\mathbb {Z}_m\), for \(m \ge 2\).
Literatur
1.
Zurück zum Zitat Barra A.: Equivalence theorems and the local-global property. Doctoral dissertation, University of Kentucky (2012). Barra A.: Equivalence theorems and the local-global property. Doctoral dissertation, University of Kentucky (2012).
2.
Zurück zum Zitat Barra A.: MacWilliams Equivalence theorem for the Lee weight over \(\mathbb{Z}_{4p + 1}\). Malays. J. Sci. 34(2), 222–226 (2015).CrossRef Barra A.: MacWilliams Equivalence theorem for the Lee weight over \(\mathbb{Z}_{4p + 1}\). Malays. J. Sci. 34(2), 222–226 (2015).CrossRef
4.
Zurück zum Zitat Constantinescu I., Heise W., Honold T.: Monomial extensions of isometries between codes over \(\mathbb{Z}_m\). In: Proceedings of the 5th International Workshop on Algebraic and Combinatorial Coding Theory (ACCT’96), Unicorn Shumen, pp. 98–104 (1996). Constantinescu I., Heise W., Honold T.: Monomial extensions of isometries between codes over \(\mathbb{Z}_m\). In: Proceedings of the 5th International Workshop on Algebraic and Combinatorial Coding Theory (ACCT’96), Unicorn Shumen, pp. 98–104 (1996).
7.
Zurück zum Zitat Greferath M., Honold T.: Monomial extensions of isometries of linear codes II: invariant weight functions on \(\mathbb{Z}_m\). In: Proceedings of the Tenth International Workshop in Algebraic and Combinatorial Coding Theory (ACCT-10), Zvenigorod, Russia, pp. 106–111 (2006). Greferath M., Honold T.: Monomial extensions of isometries of linear codes II: invariant weight functions on \(\mathbb{Z}_m\). In: Proceedings of the Tenth International Workshop in Algebraic and Combinatorial Coding Theory (ACCT-10), Zvenigorod, Russia, pp. 106–111 (2006).
8.
Zurück zum Zitat Greferath M., Nechaev A., Wisbauer R.: Finite quasi-Frobenius modules and linear codes. J. Algebra Appl. 03(03), 247–272 (2004).MathSciNetCrossRefMATH Greferath M., Nechaev A., Wisbauer R.: Finite quasi-Frobenius modules and linear codes. J. Algebra Appl. 03(03), 247–272 (2004).MathSciNetCrossRefMATH
11.
Zurück zum Zitat Huppert B.: Character Theory of Finite Groups. No. 25 in De Gruyter Expositions in Mathematics. Walter de Gruyter, Berlin (1998). Huppert B.: Character Theory of Finite Groups. No. 25 in De Gruyter Expositions in Mathematics. Walter de Gruyter, Berlin (1998).
13.
Zurück zum Zitat Langevin P., Wood J.A.: The extension theorem for the Lee and Euclidean weights over \({\mathbb{Z}}/ p^k {\mathbb{Z}}\). J. Pure Appl. Algebra (2018, to appear). Langevin P., Wood J.A.: The extension theorem for the Lee and Euclidean weights over \({\mathbb{Z}}/ p^k {\mathbb{Z}}\). J. Pure Appl. Algebra (2018, to appear).
18.
Zurück zum Zitat Terras A.: Fourier Analysis on Finite Groups and Applications. Cambridge University Press, Cambridge (1999).CrossRefMATH Terras A.: Fourier Analysis on Finite Groups and Applications. Cambridge University Press, Cambridge (1999).CrossRefMATH
21.
Zurück zum Zitat Wood J.A.: Weight functions and the extension theorem for linear codes over finite rings. Contemp. Math. 225, 231–243 (1999).MathSciNetCrossRefMATH Wood J.A.: Weight functions and the extension theorem for linear codes over finite rings. Contemp. Math. 225, 231–243 (1999).MathSciNetCrossRefMATH
Metadaten
Titel
The extension theorem for Lee and Euclidean weight codes over integer residue rings
verfasst von
Serhii Dyshko
Publikationsdatum
24.07.2018
Verlag
Springer US
Erschienen in
Designs, Codes and Cryptography / Ausgabe 6/2019
Print ISSN: 0925-1022
Elektronische ISSN: 1573-7586
DOI
https://doi.org/10.1007/s10623-018-0521-2

Weitere Artikel der Ausgabe 6/2019

Designs, Codes and Cryptography 6/2019 Zur Ausgabe