대한수학회보 (Bulletin of the Korean Mathematical Society)

  • 제56권2호
  • /
  • Pages.419-437
  • /
  • 2019
  • /
  • 1015-8634(pISSN)
  • /
  • 2234-3016(eISSN)
대한수학회 (Korean Mathematical Society)
권호 표지
DOI QR코드

DOI QR Code

SKEW CONSTACYCLIC CODES OVER FINITE COMMUTATIVE SEMI-SIMPLE RINGS

  • Dinh, Hai Q. (Division of Computational Mathematics and Engineering Institute for Computational Science Ton Duc Thang University) ;
  • Nguyen, Bac Trong (Nguyen Tat Thanh University) ;
  • Sriboonchitta, Songsak (Faculty of Economics Chiang Mai University)
  • 투고 : 2018.04.04
  • 심사 : 2019.01.08
  • 발행 : 2019.03.31
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

This paper investigates skew ${\Theta}-{\lambda}$-constacyclic codes over $R=F_0{\oplus}F_1{\oplus}{\cdots}{\oplus}F_{k-1}$, where $F{_i}^{\prime}s$ are finite fields. The structures of skew ${\lambda}$-constacyclic codes over finite commutative semi-simple rings and their duals are provided. Moreover, skew ${\lambda}$-constacyclic codes of arbitrary length are studied under a new definition. We also show that a skew cyclic code of arbitrary length over finite commutative semi-simple rings is equivalent to either a cyclic code over R or a quasi-cyclic code over R.

키워드

과제정보

연구 과제 주관 기관 : Chaing Mai University

참고문헌

  1. M. M. Al-Ashker, Simplex codes over the ring $F_2$ + $uF_2$, Arab. J. Sci. Eng. Sect. A Sci. 30 (2005), no. 2, 277-285.
  2. A. Bonnecaze and P. Udaya, Cyclic codes and self-dual codes over $F_2$ + $uF_2$, IEEE Trans. Inform. Theory 45 (1999), no. 4, 1250-1255. https://doi.org/10.1109/18.761278
  3. D. Boucher, W. Geiselmann, and F. Ulmer, Skew-cyclic codes, Appl. Algebra Engrg. Comm. Comput. 18 (2007), no. 4, 379-389. https://doi.org/10.1007/s00200-007-0043-z
  4. D. Boucher, P. Sole, and F. Ulmer, Skew constacyclic codes over Galois rings, Adv. Math. Commun. 2 (2008), no. 3, 273-292. https://doi.org/10.3934/amc.2008.2.273
  5. D. Boucher and F. Ulmer, Coding with skew polynomial rings, J. Symbolic Comput. 44 (2009), no. 12, 1644-1656. https://doi.org/10.1016/j.jsc.2007.11.008
  6. D. Boucher and F. Ulmer, A note on the dual codes of module skew codes, in Cryptography and coding, 230-243, Lecture Notes in Comput. Sci., 7089, Springer, Heidelberg, 2011.
  7. D. Boucher and F. Ulmer, Self-dual skew codes and factorization of skew polynomials, J. Symbolic Comput. 60 (2014), 47-61. https://doi.org/10.1016/j.jsc.2013.10.003
  8. H. Q. Dinh, On repeated-root constacyclic codes of length $4p^s$, Asian-Eur. J. Math. 6 (2013), no. 2, 1350020, 25 pp. https://doi.org/10.1142/S1793557113500204
  9. H. Q. Dinh, B. T. Nguyen, and S. Sriboonchitta, Skew constacyclic codes over finite fields and finite chain rings, Math. Probl. Eng. 2016 (2016), Art. ID 3965789, 17 pp.
  10. H. Q. Dinh, B. T. Nguyen, and S. Sriboonchitta, Constacyclic codes over finite commutative semi-simple rings, Finite Fields Appl. 45 (2017), 1-18. https://doi.org/10.1016/j.ffa.2016.11.008
  11. J. Gao, Skew cyclic codes over $F_p$ + $vF_p$, J. Appl. Math. Inform. 31 (2013), no. 3-4, 337-342. https://doi.org/10.14317/jami.2013.337
  12. J. Gao, L. Shen, and F.-W. Fu, A Chinese remainder theorem approach to skew generalized quasi-cyclic codes over finite fields, Cryptogr. Commun. 8 (2016), no. 1, 51-66. https://doi.org/10.1007/s12095-015-0140-y
  13. F. Gursoy, I. Siap, and B. Yildiz, Construction of skew cyclic codes over ${\mathbb{F}}_q$ + $v{\mathbb{F}}_q$, Adv. Math. Commun. 8 (2014), no. 3, 313-322. https://doi.org/10.3934/amc.2014.8.313
  14. S. Jitman, S. Ling, and P. Udomkavanich, Skew constacyclic codes over finite chain rings, Adv. Math. Commun. 6 (2012), no. 1, 39-63. https://doi.org/10.3934/amc.2012.6.39
  15. J. L. Massey, Linear codes with complementary duals, Discrete Math. 106/107 (1992), 337-342. https://doi.org/10.1016/0012-365X(92)90563-U
  16. I. Siap, T. Abualrub, N. Aydin, and P. Seneviratne, Skew cyclic codes of arbitrary length, Int. J. Inf. Coding Theory 2 (2011), no. 1, 10-20. https://doi.org/10.1504/IJICOT.2011.044674
  17. P. Udaya and A. Bonnecaze, Decoding of cyclic codes over $F_2$ + $uF_2$, IEEE Trans. Inform. Theory 45 (1999), no. 6, 2148-2157. https://doi.org/10.1109/18.782165