본문 바로가기
KERD
논문KCI 등재

On a class of constacyclic codes of length $2p^s$ over $\frac{\mathbb F_{p^m}[u]}{\left\langle u^a \right\rangle}$

Hai Q. Dinh|Bac Trong Nguyen|Songsak Sriboonchitta
대한수학회 (The Korean Mathematical Society)|2018.07|대한수학회보 (Bulletin of the KMS)|제55권 제4호|pp. 1189-1208

2

조회

0

다운로드

0

인용

0

참고문헌

키워드

constacyclic codesdual codeschain rings
주제분류수학

초록

The aim of this paper is to study the class of $\Lambda$-constacyclic codes of length $2p^s$ over the finite commutative chain ring ${\mathcal R}_a=\frac{\mathbb F_{p^m}[u]}{\left\langle u^a \right\rangle}=\mathbb F_{p^m} + u \mathbb F_{p^m}+ \dots + u^{a-1}\mathbb F_{p^m}$, for all units $\Lambda$ of $\mathcal R_a$ that have the form $\Lambda=\Lambda_0+u\Lambda_1+\dots+u^{a-1}\Lambda_{a-1}$, where $\Lambda_0, \Lambda_1, \dots, \Lambda_{a-1} \in \mathbb F_{p^m}$, $\Lambda_0 \,{\not=}\, 0, \, \Lambda_1 \,{\not=}\, 0$. The algebraic structure of all $\Lambda$-constacyclic codes of length $2p^s$ over ${\mathcal R}_a$ and their duals are established. As an application, this structure is used to determine the Rosenbloom-Tsfasman (RT) distance and weight distributions of all such codes. Among such constacyclic codes, the unique MDS code with respect to the RT distance is obtained.

Abstract

The aim of this paper is to study the class of $\Lambda$-constacyclic codes of length $2p^s$ over the finite commutative chain ring ${\mathcal R}_a=\frac{\mathbb F_{p^m}[u]}{\left\langle u^a \right\rangle}=\mathbb F_{p^m} + u \mathbb F_{p^m}+ \dots + u^{a-1}\mathbb F_{p^m}$, for all units $\Lambda$ of $\mathcal R_a$ that have the form $\Lambda=\Lambda_0+u\Lambda_1+\dots+u^{a-1}\Lambda_{a-1}$, where $\Lambda_0, \Lambda_1, \dots, \Lambda_{a-1} \in \mathbb F_{p^m}$, $\Lambda_0 \,{\not=}\, 0, \, \Lambda_1 \,{\not=}\, 0$. The algebraic structure of all $\Lambda$-constacyclic codes of length $2p^s$ over ${\mathcal R}_a$ and their duals are established. As an application, this structure is used to determine the Rosenbloom-Tsfasman (RT) distance and weight distributions of all such codes. Among such constacyclic codes, the unique MDS code with respect to the RT distance is obtained.

참고문헌 (38)

  1. M. C. V. Amarra, "On (1 − u)-cyclic codes over <TEX>$\mathbb{F}_{p^{\kappa}} + u\mathbb{F}_{p^{\kappa}}$<", TEX>, 2008, pp.21(11), 1129~1133
  2. E. Berlekamp, "Negacyclic codes for the Lee metric", Combinatorial Mathematics and its Applications (Proc. Conf., Univ. North Carolina), pp.298~316 (1968)
  3. E. Berlekamp, "Algebraic Coding Theory, revised edition" (2015), World Scientific Publishing Co. Pte. Ltd.
  4. S. D. Berman, "Semisimple cyclic and Abelian codes. II", Cybernetics, 3(3), pp.17~23 (1967)
  5. A. Bonnecaze, "Cyclic codes and self-dual codes over <TEX>$F_2 + uF_2$<", TEX>, 1999, pp.45(4), 1250~1255
  6. A. R. Calderbank, "A linear construction for certain Kerdock and Preparata codes", Bull. Amer. Math. Soc. (N.S.), 29(2), pp.218~222 (1993)[DOI]
  7. G. Castagnoli, "On repeated-root cyclic codes", IEEE Trans. Inform. Theory, 37(2), pp.337~342 (1991)[DOI]
  8. B. Chen, "Constacyclic codes of length <TEX>$2p^s$<", TEX> over <TEX>$\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}$<, Finite Fields & Appl., pp.2016, 36[DOI]
  9. B. Chen, "Matrix product codes with Rosenbloom-Tsfasman metric", Acta Math. Sci. Ser. B Engl. Ed., 33(3), pp.687~700 (2013)
  10. H. Q. Dinh, "Constacyclic codes of length <TEX>$2^s$<", TEX> over Galois extension rings of <TEX>$\mathbb{F}_2 + u\mathbb{F}_2$<, IEEE Trans. Inform. Theory, pp.2009, 55(4)[DOI]
  11. H. Q. Dinh, "Constacyclic codes of length <TEX>$p^s$<", TEX> over <TEX>$\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}$<, J. Algebra, pp.2010, 324(5)[DOI]
  12. H. Q. Dinh, "Repeated-root constacyclic codes of length <TEX>$2p^s$<", TEX>, 2012, pp.18, 133~143
  13. H. Q. Dinh, "Structure of repeated-root constacyclic codes of length <TEX>$3p^s$<", TEX> and their duals, 2013, pp.313(9), 983~991
  14. TEX>, in Ring theory and its applications;Contemp. Math., 609, "Repeated-root cyclic and negacyclic codes of length <TEX>$6p^s$<", pp.2014, H. Q. Dinh
  15. }{<u^a>}$<, "TEX> and their duals", Discrete Math., 339(6), pp.1706~1715 (2016)[DOI]
  16. H. Q. Dinh, "Cyclic and negacyclic codes over finite chain rings", IEEE Trans. Inform. Theory, 50(8), pp.1728~1744 (2004)[DOI]
  17. H. Q. Dinh, "Negacyclic codes of length <TEX>$2p^s$<", TEX> over <TEX>$\mathbb{F}_{p^m} + u\mathbb{F}_{p^m}$<, Finite Fields & Appl., pp.2015, 31[DOI]
  18. S. Dougherty, "Type II codes over <TEX>$F_2 + uF_2$<", TEX>, 1999, pp.45(1), 32~45
  19. S. T. Dougherty, "MacWilliams duality and the RosenbloomTsfasman metric", Mosc. Math. J., 2(1), pp.81~97;199 (2002)
  20. G. Falkner, "On the existence of cyclic optimal codes", Atti Sem. Mat. Fis. Univ. Modena, 28(2), pp.326~341 (1979)
  21. A. R. Hammons, "The <TEX>$Z_4$<", TEX>-linearity of Kerdock, Preparata, Goethals, and related codes, 1994, pp.40(2), 301~319
  22. W. C. Huffman, "Fundamentals of Error-Correcting Codes" (2003), Cambridge University Press
  23. K. Lee, "The automorphism group of a linear space with the Rosenbloom-Tsfasman metric", European J. Combin., 24(6), pp.607~612 (2003)[DOI]
  24. S. Ling, "Duadic codes over <TEX>$F_2 + uF_2$<", TEX>, 2001, pp.12(5), 365~379
  25. J. L. Massey, "Polynomial weights and code constructions", IEEE Trans. Information Theory, IT-19, pp.101~110 (1973)
  26. A. A. Nechaev, "Kerdock code in a cyclic form", Discrete Math. Appl., 1(4), pp.365~384 (1991)
  27. G. Norton, "On the structure of linear and cyclic codes over a finite chain ring", Appl. Algebra Engrg. Comm. Comput., 10(6), pp.489~506 (2000)[DOI]
  28. V. Pless, "Handbook of Coding Theory" (1998), Elsevier
  29. E. Prange, "Cyclic Error-Correcting Codes in Two Symbols, TN-57-103", ~ (1957)
  30. E. Prange, "Some cyclic error-correcting codes with simple decoding algorithms, TN-58-156", ~ (1958)
  31. E. Prange, "The use of coset equivalence in the analysis and decoding of group codes, TN-59-164", ~ (1959)
  32. E. Prange, "An algorithm for factoring <TEX>$x^n$<", TEX>−1 over a finite field, TN-59-175, 1959
  33. M. Y. Rosenbloom, "Codes for the m-metric", Problems Inf. Trans., 33, pp.45~52 (1997)
  34. R. M. Roth, "On cyclic MDS codes of length q over GF(q)", IEEE Trans. Inform. Theory, 32(2), pp.284~285 (1986)[DOI]
  35. M. M. Skriganov, "On linear codes with large weights simultaneously for the RosenbloomTsfasman and Hamming metrics", J. Complexity, 23(4-6), pp.926~936 (2007)[DOI]
  36. R. Sobhani, "Cyclic and negacyclic codes over the Galois ring GR(<TEX>$p^2$<", TEX>, m), 2009, pp.157(13), 2892~2903
  37. P. Udaya, "Decoding of cyclic codes over <TEX>$F_2 + uF_2$<", TEX>, 1999, pp.45(6), 2148~2157
  38. J. H. van Lint, "Repeated-root cyclic codes", IEEE Trans. Inform. Theory, 37(2), pp.343~345 (1991)[DOI]

관련 논문AI추천

Repeated-root constacyclic codes of length $2p^s$ over Galois ringsChakkrid Klin-eam, Wateekorn Sriwirach대한수학회 · 대한수학회보2019 · 제56권 제1호SOME CLASSES OF REPEATED-ROOT CONSTACYCLIC CODES OVER Fpm + uFpm + u2FpmXiaofang Xu, Xiusheng Liu대한수학회 · 대한수학회지2014 · 제51권 제4호Negacyclic codes of length $8p^s$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$Chakkrid Klin-eam, Jirayu Phuto대한수학회 · 대한수학회보2019 · 제56권 제6호CYCLIC CODES OF LENGTH ps OVER Fpm[u] ⟨ue⟩Karim Samei, Masoumeh Mohebbei, Rashid Rezaei, Roghayeh Mohammadi Hesari대한수학회 · 대한수학회논문집2024 · 제39권 제1호Skew constacyclic codes over finite commutative semi-simple ringsBac Trong Nguyen, Hai Q. Dinh, Songsak Sriboonchitta대한수학회 · 대한수학회보2019 · 제56권 제2호Cyclic codes over the ring ${\mathbb F}_p[u,v,w]/\langle u^2, v^2, w^2, uv-vu, vw-wv, uw-wu \rangle$Pramod Kumar Kewat, Sarika Kushwaha대한수학회 · 대한수학회보2018 · 제55권 제1호

이 간행물의 다른 논문 (22건)

On generalized Krull power series ringsPhan Thanh Toan, Le Thi Ngoc Giaupp. 1007-1012$\eta$-parallel H-contact 3-manifolds조종택pp. 1013-1022Morphisms of varieties over ample fieldsMoshe Jarden, Wulf-Dieter Geyer, Lior Bary-Sorokerpp. 1023-1035A note on the units of Mantaci-Reutenauer algebraHimmet Can, Hasan Arslanpp. 1037-1049Real polyhedral products, Moore's conjecture, and simplicial actions on real toric spaces김진홍pp. 1051-1063
원문 보기