Skip to main content
Erschienen in: Applicable Algebra in Engineering, Communication and Computing 1/2023

19.01.2021 | Original Paper

On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ring

verfasst von: Hai Q. Dinh, Narendra Kumar, Abhay Kumar Singh, Manoj Kumar Singh, Indivar Gupta, Paravee Maneejuk

Erschienen in: Applicable Algebra in Engineering, Communication and Computing | Ausgabe 1/2023

Einloggen

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

search-config
loading …

Abstract

Let \(\gamma = 4z-1\) be an unit of Type \((*^{-})\) of the Galois ring \({{\,\mathrm{GR}\,}}(2^a, m)\). The \(\gamma\)-constacyclic codes of length \(2^s\) over the Galois ring \({{\,\mathrm{GR}\,}}(2^a, m)\) are precisely the ideals \(\langle (x +1)^i \rangle\), \(0 \le i \le 2^sa\) of the chain ring \(\mathfrak {R}(a,m, \gamma ) = \dfrac{{{\,\mathrm{GR}\,}}(2^a,m)[x]}{\langle {x^{2^s}} - \gamma \rangle }\). This structure is used to determine the symbol pair distance of \(\gamma\)-constacyclic codes of length \(2^s\) over \({{\,\mathrm{GR}\,}}(2^a, m)\). The exact symbol-pair distances for all such \(\gamma\)-constacyclic codes of length \(2^s\) over \({{\,\mathrm{GR}\,}}(2^a, m)\) are obtained. Also, we provide the MDS symbol-pair codes of length \(2^s\) over \({{\,\mathrm{GR}\,}}(2^a, m)\) and some examples are computed.

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 "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!

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!

Literatur
1.
Zurück zum Zitat Abualrub, T., Oehmke, R.: On the generators of \({\mathbb{Z}}_{4}\) cyclic codes of length \(2^e\). IEEE Trans. Inf. Theory 49, 2126–2133 (2003)CrossRefMATH Abualrub, T., Oehmke, R.: On the generators of \({\mathbb{Z}}_{4}\) cyclic codes of length \(2^e\). IEEE Trans. Inf. Theory 49, 2126–2133 (2003)CrossRefMATH
2.
Zurück zum Zitat Berman S.D., Semisimple cyclic and Abelian codes. II, Kibernetika (Kiev) 3, 21–30 (1967) (in Rus-sian); English translation: Cybernetics 3, 17-23 (1967) Berman S.D., Semisimple cyclic and Abelian codes. II, Kibernetika (Kiev) 3, 21–30 (1967) (in Rus-sian); English translation: Cybernetics 3, 17-23 (1967)
3.
Zurück zum Zitat Calderbank, A.R., Hammons, A.R., Kumar, P.V., Sloane, N.J.A., Solé, P.: A linear construction for certain Kerdock and Preparata codes. Bull. Am. Math. Soc. 29, 218–222 (1993)MathSciNetCrossRefMATH Calderbank, A.R., Hammons, A.R., Kumar, P.V., Sloane, N.J.A., Solé, P.: A linear construction for certain Kerdock and Preparata codes. Bull. Am. Math. Soc. 29, 218–222 (1993)MathSciNetCrossRefMATH
4.
Zurück zum Zitat Cassuto, Y., Blaum, M.: Codes for symbol-pair read channels. In: Conference in Proceedings IEEE International Symposium Information Theory, Austin, pp. 988–992 (2010) Cassuto, Y., Blaum, M.: Codes for symbol-pair read channels. In: Conference in Proceedings IEEE International Symposium Information Theory, Austin, pp. 988–992 (2010)
6.
Zurück zum Zitat Cassuto, Y., Litsyn, S.: Symbol-pair codes: algebraic constructions and asymptotic bounds. In: Conference in Proceedings IEEE International Symposium on Information Theory, St. Petersburg, Russia, pp. 2348–2352 (2011) Cassuto, Y., Litsyn, S.: Symbol-pair codes: algebraic constructions and asymptotic bounds. In: Conference in Proceedings IEEE International Symposium on Information Theory, St. Petersburg, Russia, pp. 2348–2352 (2011)
7.
8.
Zurück zum Zitat Chee, Y.M., Ji, L., Kiah, H.M., Wang, C., Yin, J.: Maximum distance separable codes for symbol-pair read channels. IEEE Trans. Inf. Theory 59, 7259–7267 (2013)MathSciNetCrossRefMATH Chee, Y.M., Ji, L., Kiah, H.M., Wang, C., Yin, J.: Maximum distance separable codes for symbol-pair read channels. IEEE Trans. Inf. Theory 59, 7259–7267 (2013)MathSciNetCrossRefMATH
9.
Zurück zum Zitat Castagnoli, G., Massey, J.L., Schoeller, P.A., von Seemann, N.: On repeated-root cyclic codes. IEEE Trans. Inform. Theory 37, 337–342 (1991)MathSciNetCrossRefMATH Castagnoli, G., Massey, J.L., Schoeller, P.A., von Seemann, N.: On repeated-root cyclic codes. IEEE Trans. Inform. Theory 37, 337–342 (1991)MathSciNetCrossRefMATH
11.
Zurück zum Zitat Ding, B., Zhang, T., Ge, G.: Maximum distance separable codes for b-symbol read channels. Finite Fields Their Appl. 49, 180–197 (2018)MathSciNetCrossRefMATH Ding, B., Zhang, T., Ge, G.: Maximum distance separable codes for b-symbol read channels. Finite Fields Their Appl. 49, 180–197 (2018)MathSciNetCrossRefMATH
12.
Zurück zum Zitat Dinh, H.Q.: On some classes of repeated-root constacyclic codes of length a power of 2 over Galois rings. In: Trends Math, pp. 131–147 (2010) Dinh, H.Q.: On some classes of repeated-root constacyclic codes of length a power of 2 over Galois rings. In: Trends Math, pp. 131–147 (2010)
13.
Zurück zum Zitat Dinh, H.Q., Vo, T.M.: Repeated-root cyclic and negacyclic codes of prime power lengths with a finite commutative chain ring alphabet. East West J. Math. 13, 207–224 (2011)MathSciNetMATH Dinh, H.Q., Vo, T.M.: Repeated-root cyclic and negacyclic codes of prime power lengths with a finite commutative chain ring alphabet. East West J. Math. 13, 207–224 (2011)MathSciNetMATH
16.
Zurück zum Zitat Dinh, H.Q.: Constacyclic codes of length \(2^s\) over Galois extension rings of \({\mathbb{F}}_{2} + u{\mathbb{F}}_{2}\). IEEE Trans. Inform. Theory 55, 1730–1740 (2009)MathSciNetCrossRef Dinh, H.Q.: Constacyclic codes of length \(2^s\) over Galois extension rings of \({\mathbb{F}}_{2} + u{\mathbb{F}}_{2}\). IEEE Trans. Inform. Theory 55, 1730–1740 (2009)MathSciNetCrossRef
17.
Zurück zum Zitat Dinh, H.Q., López-Permouth, S.R.: Cyclic and negacyclic codes over finite chain rings. IEEE Trans. Inform. Theory 50, 1728–1744 (2004)MathSciNetCrossRefMATH Dinh, H.Q., López-Permouth, S.R.: Cyclic and negacyclic codes over finite chain rings. IEEE Trans. Inform. Theory 50, 1728–1744 (2004)MathSciNetCrossRefMATH
18.
Zurück zum Zitat Dinh, H.Q.: Constacyclic codes of length \(p^s\) over ring \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\). J. Algebra 324, 940–950 (2010)MathSciNetCrossRef Dinh, H.Q.: Constacyclic codes of length \(p^s\) over ring \(\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}\). J. Algebra 324, 940–950 (2010)MathSciNetCrossRef
19.
Zurück zum Zitat Dinh, H.Q.: Repeated root constacyclic codes of length \(2^s\) over \({\mathbb{Z}}_{2}^{a}\). In: Algebra and Its Applications. Contemporary Mathematics American Mathematical Society, vol. 419, pp. 95–110 (2006) Dinh, H.Q.: Repeated root constacyclic codes of length \(2^s\) over \({\mathbb{Z}}_{2}^{a}\). In: Algebra and Its Applications. Contemporary Mathematics American Mathematical Society, vol. 419, pp. 95–110 (2006)
20.
Zurück zum Zitat Dinh, H.Q.: Complete distances of all negacyclic codes of length \(2^s\) over \({{\mathbb{Z}}}_{2^{a} }\). IEEE Trans. Inform. Theory 53, 147–161 (2007)MathSciNetCrossRef Dinh, H.Q.: Complete distances of all negacyclic codes of length \(2^s\) over \({{\mathbb{Z}}}_{2^{a} }\). IEEE Trans. Inform. Theory 53, 147–161 (2007)MathSciNetCrossRef
21.
Zurück zum Zitat Dinh, H.Q.: Negacyclic codes of length \(2^s\) over Galois rings. IEEE Trans. Inf. Theory 51, 4252–4262 (2005)CrossRefMATH Dinh, H.Q.: Negacyclic codes of length \(2^s\) over Galois rings. IEEE Trans. Inf. Theory 51, 4252–4262 (2005)CrossRefMATH
22.
Zurück zum Zitat Dinh, H.Q., Liu, H., Liu, X., Sriboonchitta, S.: On structure and distances of some classes of repeated-root constacyclic codes over Galois rings. Finite Fields Appl. 43, 86–105 (2017)MathSciNetCrossRefMATH Dinh, H.Q., Liu, H., Liu, X., Sriboonchitta, S.: On structure and distances of some classes of repeated-root constacyclic codes over Galois rings. Finite Fields Appl. 43, 86–105 (2017)MathSciNetCrossRefMATH
23.
Zurück zum Zitat Dinh, H.Q.: On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions. Finite Fields Appl. 14, 22–40 (2008)MathSciNetCrossRefMATH Dinh, H.Q.: On the linear ordering of some classes of negacyclic and cyclic codes and their distance distributions. Finite Fields Appl. 14, 22–40 (2008)MathSciNetCrossRefMATH
24.
Zurück zum Zitat Dinh, H.Q.: Structure of some classes of repeated-root constacyclic codes over integers modulo \(2^m\). Ser. Lect. Notes Pure Appl. Math. 248, 105–117 (2006)CrossRefMATH Dinh, H.Q.: Structure of some classes of repeated-root constacyclic codes over integers modulo \(2^m\). Ser. Lect. Notes Pure Appl. Math. 248, 105–117 (2006)CrossRefMATH
25.
Zurück zum Zitat Falkner, G., Kowol, B., Heise, W., Zehendner, E.: On the existence of cyclic optimal codes. Atti Semin. Mat. Fis. Univ. Modena 28, 326–341 (1979)MathSciNetMATH Falkner, G., Kowol, B., Heise, W., Zehendner, E.: On the existence of cyclic optimal codes. Atti Semin. Mat. Fis. Univ. Modena 28, 326–341 (1979)MathSciNetMATH
26.
Zurück zum Zitat Hirotomo, M., Takita, M., Morii, M.: Syndrome decoding of symbol-pair codes. In: Conference in Proceedings IEEE Information Theory Workshop, Hobart, pp. 162–166 (2014) Hirotomo, M., Takita, M., Morii, M.: Syndrome decoding of symbol-pair codes. In: Conference in Proceedings IEEE Information Theory Workshop, Hobart, pp. 162–166 (2014)
27.
Zurück zum Zitat Hammons Jr., A.R., Kumar, P.V., Calderbank, A.R., Sloane, N.J.A., Solé, P.: The \({\mathbb{Z}}_{4}\)-linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inf. Theory 40, 301–319 (1994)CrossRefMATH Hammons Jr., A.R., Kumar, P.V., Calderbank, A.R., Sloane, N.J.A., Solé, P.: The \({\mathbb{Z}}_{4}\)-linearity of Kerdock, Preparata, Goethals, and related codes. IEEE Trans. Inf. Theory 40, 301–319 (1994)CrossRefMATH
28.
Zurück zum Zitat Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)CrossRefMATH Huffman, W.C., Pless, V.: Fundamentals of Error-Correcting Codes. Cambridge University Press, Cambridge (2003)CrossRefMATH
29.
30.
Zurück zum Zitat McDonald B.R.: Finite rings with identity. In: Pure and Applied Mathematics, vol. 28. Marcel Dekker, New York (1974) McDonald B.R.: Finite rings with identity. In: Pure and Applied Mathematics, vol. 28. Marcel Dekker, New York (1974)
31.
Zurück zum Zitat Massey, J.L., Costello, D.J., Justesen, J.: Polynomial weights and code constructions. IEEE Trans. Inf. Theory 19, 101–110 (1973)MathSciNetCrossRefMATH Massey, J.L., Costello, D.J., Justesen, J.: Polynomial weights and code constructions. IEEE Trans. Inf. Theory 19, 101–110 (1973)MathSciNetCrossRefMATH
33.
Zurück zum Zitat Pless, V., Huffman, W.C.: Handbook of Coding Theory. Elsevier, Amsterdam (1998)MATH Pless, V., Huffman, W.C.: Handbook of Coding Theory. Elsevier, Amsterdam (1998)MATH
34.
Zurück zum Zitat Roth, R.M., Seroussi, G.: On cyclic MDS codes of length qover GF(q). IEEE Trans. Inf. Theory 32, 284–285 (1986)CrossRefMATH Roth, R.M., Seroussi, G.: On cyclic MDS codes of length qover GF(q). IEEE Trans. Inf. Theory 32, 284–285 (1986)CrossRefMATH
35.
Zurück zum Zitat Sălăgean, A.: Repeated-root cyclic and negacyclic codes over finite chain rings. Discrete Appl. Math. 154, 413–419 (2006)MathSciNetCrossRefMATH Sălăgean, A.: Repeated-root cyclic and negacyclic codes over finite chain rings. Discrete Appl. Math. 154, 413–419 (2006)MathSciNetCrossRefMATH
36.
Zurück zum Zitat Tang, L., Soh, C.B., Gunawan, E.: A note on the q-ary image of a \(q^m\)-ary repeated-root cyclic code. IEEE Trans. Inf. Theory 43, 732–737 (1997)CrossRefMATH Tang, L., Soh, C.B., Gunawan, E.: A note on the q-ary image of a \(q^m\)-ary repeated-root cyclic code. IEEE Trans. Inf. Theory 43, 732–737 (1997)CrossRefMATH
39.
Zurück zum Zitat Yaakobi, E., Bruck, J., Siegel, P.H.: Decoding of cyclic codes over symbol-pair read channels. In: Conference in Proceedings International Symposium Information Theory, Cambridge, pp. 2891–2895 (2012) Yaakobi, E., Bruck, J., Siegel, P.H.: Decoding of cyclic codes over symbol-pair read channels. In: Conference in Proceedings International Symposium Information Theory, Cambridge, pp. 2891–2895 (2012)
40.
Zurück zum Zitat Yaakobi, E., Bruck, J., Siegel, P.H.: Constructions and decoding of cyclic codes over b-symbol read channels. IEEE Trans. Inf. Theory 62, 1541–1551 (2016)MathSciNetCrossRefMATH Yaakobi, E., Bruck, J., Siegel, P.H.: Constructions and decoding of cyclic codes over b-symbol read channels. IEEE Trans. Inf. Theory 62, 1541–1551 (2016)MathSciNetCrossRefMATH
41.
Zurück zum Zitat Yaakobi, E., Bruck, J., Siegel, P.H.: Decoding of cyclic codes over symbol-pair read channels. In: Conference in Proceedings of International Symposium Information Theory, Cambridge, pp. 2891–2895 (2012) Yaakobi, E., Bruck, J., Siegel, P.H.: Decoding of cyclic codes over symbol-pair read channels. In: Conference in Proceedings of International Symposium Information Theory, Cambridge, pp. 2891–2895 (2012)
Metadaten
Titel
On the symbol-pair distance of some classes of repeated-root constacyclic codes over Galois ring
verfasst von
Hai Q. Dinh
Narendra Kumar
Abhay Kumar Singh
Manoj Kumar Singh
Indivar Gupta
Paravee Maneejuk
Publikationsdatum
19.01.2021
Verlag
Springer Berlin Heidelberg
Erschienen in
Applicable Algebra in Engineering, Communication and Computing / Ausgabe 1/2023
Print ISSN: 0938-1279
Elektronische ISSN: 1432-0622
DOI
https://doi.org/10.1007/s00200-020-00472-6

Weitere Artikel der Ausgabe 1/2023

Applicable Algebra in Engineering, Communication and Computing 1/2023 Zur Ausgabe

Premium Partner