nach oben

Applicable Algebra in Engineering, Communication and Computing

Erschienen in:

24.04.2020 | Original Paper

Hamming distance of repeated-root constacyclic codes of length \(2p^s\) over \({\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m}\)

verfasst von: Hai Q. Dinh, A. Gaur, Indivar Gupta, Abhay K. Singh, Manoj Kumar Singh, Roengchai Tansuchat

Erschienen in: Applicable Algebra in Engineering, Communication and Computing | Ausgabe 3-4/2020

Einloggen

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

search-config

KI-gestützte Suche

Aus

Abstract

Let p be an odd prime, and \(\delta\) be an arbitrary unit of the finite chain ring \({\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m} \,\, (u^2=0)\). The Hamming distances of all \(\delta\)-constacyclic codes of length \(2p^s\) over \({\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m}\) are completely determined. We provide some examples from which some codes have better parameters than the existing ones. As applications, we determine all MDS repeated-root \(\delta\)-constacyclic codes of length \(2p^s\) over \(\mathbb F_{p^m}+u{\mathbb {F}}_{p^m}\).

Vorheriger Artikel Optimal RS-like LRC codes of arbitrary length

Nächster Artikel Boomerang uniformity of normalized permutation polynomials of low degree

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!

Jetzt informieren

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!

Jetzt informieren

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!

Jetzt informieren

Cao, Y.-L., Cao, Y., Dinh, H.Q., Fu, F.-W., Gao, J., Sriboonchitta, S.: Constacyclic codes of length \(np^s\) over \({\mathbb{F}}_{p^m} + u{\mathbb{F}}_{p^m}\). Adv. Math. Commun. 12, 231–262 (2018)MathSciNetCrossRef

Cao, Y.-L., Cao, Y., Dinh, H.Q., Fu, F.-W., Gao, J., Sriboonchitta, S.: A class of repeated-root constacyclic codes over \({\mathbb{F}}_{p^m}[u]/\langle u^e \rangle\) of Type \(2\). Finite Fields Appl. 55, 238–267 (2019)MathSciNetCrossRef

Cao, Y.-L., Cao, Y., Dinh, H.Q., Jitman, S.: An explicit representation and enumeration for self-dual cyclic codes over \({\mathbb{F}}_{2^m}+u{\mathbb{F}}_{2^m}\) of length \(2^s\). Discrete Math. 342, 2077–2091 (2019)MathSciNetCrossRef

Cao, Y.-L., Cao, Y., Dinh, H.Q., Fu, F.-W., Gao, J., Sriboonchitta, S.: A class of linear codes of length \(2\) over finite chain rings. J. Algebra Appl. 19, 2050103.1-15 (2020)

Cao, Y.-L., Cao, Y., Dinh, H.Q., Fu, F.-W., Ma, F.: Construction and enumeration for self-dual cyclic codes of even length over \({\mathbb{F}}_{2^m} + u{\mathbb{F}}_{2^m}\). Finite Fields Appl. 61, (2020). (in press)

Cao, Y.-L., Cao, Y., Dinh, H.Q., Fu, F.-W., Maneejuk, P.: On matrix-product structure of repeated-root constacyclic codes over finite fields. Discrete Math. 343, 111768 (2020). in pressMathSciNetCrossRef

Cao, Y.-L., Cao, Y., Dinh, H.Q., Bandi, R., Fu, F.-W.: An explicit representation and enumeration for negacyclic codes of length \(2^kn\) over \({\mathbb{Z}}_4+u{\mathbb{Z}}_4\). Adv. Math. Commun. (2020). (in press)

Cao, Y.-L., Cao, Y., Dinh, H.Q., Jitman, S.: An efficient method to construct self-dual cyclic codes of length \(p^s\) over \({\mathbb{F}}_{p^m} + u{\mathbb{F}}_{p^m}\). Discrete Math. 343, 111868 (2020). in pressMathSciNetCrossRef

Cao, Y.-L., Cao, Y., Dinh, H.Q., Bag, T., Yamaka, W.: Explicit representation and enumeration of repeated-root \((\delta +\alpha u^2)\)-constacyclic codes over \({\mathbb{F}}_{2^m}[u]/\langle u^{2\lambda }\rangle\). IEEE Access 8, 55550–55562 (2020)CrossRef

10.

Chen, B., Dinh, H.Q., Liu, H., Wang, L.: Constacyclic codes of length \(2p^s\) over\({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}\). J. Finite Fields Appl. 37(Issue C), 108–130 (2016)CrossRef

11.

Castagnoli, G., Massey, J.L., Schoeller, P.A., von Seemann, N.: On repeated-root cyclic codes. IEEE Trans. Inf. Theory 37, 337–342 (1991)MathSciNetCrossRef

12.

Dinh, H.Q.: On repeated-root constacyclic codes of length \(4p^s\). Asian Eur. J. Math. 6, 1–25 (2013)CrossRef

13.

Dinh, H.Q.: Repeated-root constacyclic codes of length \(2p^s\). Finite Fields Appl. 18, 133–143 (2012)MathSciNetCrossRef

14.

Dinh, H.Q.: Structure of repeated-root constacyclic codes of length \(3p^s\) and their duals. Discrete Math. 313, 983–991 (2013)MathSciNetCrossRef

15.

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)MathSciNetCrossRef

16.

Dinh, H.Q.: Constacyclic codes of length \(p^s\) over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}\). J. Algebra 324, 940–950 (2010)MathSciNetCrossRef

17.

Dinh, H.Q., Nguyen, B.T., Singh, A.K., Sriboonchitta, S.: Hamming and symbol pair distances of repeated root constacycliccodes of prime power lengths over \({\mathbb{F}}\_{p^m} +u{\mathbb{F}}\_{p^m}\). IEEE Trans. Inf. Theory 64(4), 2417–2430 (2018)CrossRef

18.

Dinh, H.Q., Wang, X., Liu, H., Sriboonchitta, S.: On the Hamming distances of repeated-root constacyclic codes of length \(4p^s\). Discrete Math. 342(5), 1456–1470 (2019)MathSciNetCrossRef

19.

Dinh, H.Q., Nguyen, B.T., Singh, A.K., Sriboonchitta, S.: On the symbol-pair distance of repeated-root constacyclic codes of prime power lengths. IEEE Trans. Inf. Theory 64(4), 2417–2430 (2018)MathSciNetCrossRef

20.

Dinh, H.Q., Satpati, S., Singh, A.K., Yamaka, W.: Symbol-triple distance of repeated-root constacylic codes of prime power lengths. J. Algebra Appl. (2019). https://doi.org/10.1142/S0219498820502096 CrossRef

21.

Dinh, H.Q., Kumam, P., Kumar, P., Satpati, S., Singh, A.K., Yamaka, W.: MDS symbol-pair repeated-root constacylic codes of prime power lengths over \({\mathbb{F}}_{p^m}+u{\mathbb{F}}_{p^m}\). IEEE Access 7, 145039–145048 (2019)CrossRef

22.

Dinh, H.Q., Wang, X., Sirisrisakulchai, J.: Optimal b-symbol constacyclic codes with respect to the singleton bound. J. Algebra Appl. (2020). https://doi.org/10.1142/S0219498820501510 CrossRef

23.

Dinh, H.Q., Wang, X., Sirisrisakulchai, J.: On the Hamming distance of constacyclic codes of length \(5p^s\). IEEE Access 8, 46242–46254 (2020)CrossRef

24.

Dinh, H.Q., Wang, X., Maneejuk, P.: On the Hamming distance of repeated-root cyclic codes of length \(6p^s\). IEEE Access 8, 39946–39958 (2020)CrossRef

25.

Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. Online available at http://www.codetables.de. Accessed 7 May 2019

26.

Ling, S., Xing, C.: Coding Theory—A First Course. Cambridge Publications, Cambridge (2004)CrossRef

27.

Liu, Y., Shi, M., Dinh, H.Q., Sriboonchitta, S.: Repeated-root constacyclic codes of length \(3\ell ^mp^s\), Advances Math. Comm. (2019) (to appear)

28.

Lopez-Permouth, S.R., Ozadam, H., Ozbudak, F., Szabo, S.: Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes. Finite Fields Appl. 19, 16–38 (2013)MathSciNetCrossRef

29.

Ozadam, H., Ozbudak, F.: The minimum hamming distance of cyclic codes of length \(2p^s\). Appl. Algebra Eng. Commun. Comput. LNCS 5527, 92–100 (2009)MATH

30.

van Lint, J.H.: Repeated-root cyclic codes. IEEE Trans. Inform. Theory 37, 343–345 (1991)MathSciNetCrossRef

Titel: Hamming distance of repeated-root constacyclic codes of length over
verfasst von: Hai Q. Dinh
A. Gaur
Indivar Gupta
Abhay K. Singh
Manoj Kumar Singh
Roengchai Tansuchat
Publikationsdatum: 24.04.2020
Verlag: Springer Berlin Heidelberg
Erschienen in: Applicable Algebra in Engineering, Communication and Computing / Ausgabe 3-4/2020
Print ISSN: 0938-1279
Elektronische ISSN: 1432-0622
DOI: https://doi.org/10.1007/s00200-020-00432-0

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

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

Springer Professional "Wirtschaft+Technik"

Springer Professional "Wirtschaft"

Springer Professional "Technik"

Weitere Artikel der Ausgabe 3-4/2020

Optimal RS-like LRC codes of arbitrary length

A trigonometric approach for Dickson polynomials over fields of characteristic two

Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures

HELP: a sparse error locator polynomial for BCH codes

Special Issue: “Computer Algebra and Application to Combinatorics, Coding Theory and Cryptography” ACA 2019, Montreal, Canada, July 16–20, 2019

A nonexistence certificate for projective planes of order ten with weight 15 codewords