Negacyclic codes of length $8p^s$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$
2
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
Let $p$ be an odd prime. The algebraic structure of all negacyclic codes of length $8p^s$ over the finite commutative chain ring $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$ where $u^2=0$ is studied in this paper. Moreover, we classify all negacyclic codes of length $8p^s$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$ into 5 cases, i.e., $p^m\equiv 1 \pmod{16}$, $p^m\equiv 3,11 \pmod{16}$, $p^m\equiv 5,13 \pmod{16}$, $p^m\equiv 7,15 \pmod{16}$ and $p^m\equiv 9 \pmod{16}$. From that, the structures of dual and some self-dual negacyclic codes and number of codewords of negacyclic codes are obtained.
Abstract
Let $p$ be an odd prime. The algebraic structure of all negacyclic codes of length $8p^s$ over the finite commutative chain ring $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$ where $u^2=0$ is studied in this paper. Moreover, we classify all negacyclic codes of length $8p^s$ over $\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$ into 5 cases, i.e., $p^m\equiv 1 \pmod{16}$, $p^m\equiv 3,11 \pmod{16}$, $p^m\equiv 5,13 \pmod{16}$, $p^m\equiv 7,15 \pmod{16}$ and $p^m\equiv 9 \pmod{16}$. From that, the structures of dual and some self-dual negacyclic codes and number of codewords of negacyclic codes are obtained.
참고문헌 (19)
- Taher Abualrub, "Constacyclic codes over", Journal of the Franklin Institute, 346(5), pp.520~529 (2009), Elsevier BV[DOI]
- G. Castagnoli, "On repeated-root cyclic codes", IEEE Transactions on Information Theory, 37(2), pp.337~342 (1991), Institute of Electrical and Electronics Engineers (IEEE)[DOI]
- B. Chen, "Constacyclic codes of length 2ps over Fpm + uFpm", Finite Fields Appl., 37, pp.108~130 (2016)
- H.Q. Dinh, "Negacyclic Codes of Length<tex>$2^s$<", tex>Over Galois Rings, 2005, pp.51(12), 4252~4262[DOI]
- Hai Q. Dinh, "Constacyclic Codes of Length $2^s$ Over Galois Extension Rings of ${\BBF}_{2}+u{\BBF}_2$", IEEE Transactions on Information Theory, 55(4), pp.1730~1740 (2009), Institute of Electrical and Electronics Engineers (IEEE)[DOI]
- Hai Q. Dinh, "Constacyclic codes of length ps over Fpm +uFpm", Journal of Algebra, 324(5), pp.940~950 (2010), Elsevier BV[DOI]
- Hai Q. Dinh, "Repeated-root constacyclic codes of length 2ps", Finite Fields and Their Applications, 18(1), pp.133~143 (2012), Elsevier BV[DOI]
- Hai Q. Dinh, "Structure of repeated-root constacyclic codes of length 3 p s and their duals", Discrete Mathematics, 313(9), pp.983~991 (2013), Elsevier BV[DOI]
- Hai Q. Dinh, "On constacyclic codes of length 4ps over Fpm + uFpm", Discrete Mathematics, 340(4), pp.832~849 (2017), Elsevier BV[DOI]
- H. Q. Dinh, "On self-dual constacyclic codes of length ps over Fpm + uFpm", Discrete Math, 341(2), pp.324~335 (2018)
- H.Q. Dinh, "Cyclic and Negacyclic Codes Over Finite Chain Rings", IEEE Transactions on Information Theory, 50(8), pp.1728~1744 (2004), Institute of Electrical and Electronics Engineers (IEEE)[DOI]
- Hai Q. Dinh, "Negacyclic codes of length 4 p s over F p m + u F p m and their duals", Discrete Mathematics, 341(4), pp.1055~1071 (2018), Elsevier BV[DOI]
- Hai Q. Dinh, "On (α + uβ)-constacyclic codes of length 4ps over 𝔽pm + u𝔽pm∗", Journal of Algebra and Its Applications, 18(02), pp.1950023~ (2019), World Scientific Pub Co Pte Lt[DOI]
- Hai Quang Dinh, "Negacyclic codes of length 2 p s over F p m + u F p m", Finite Fields and Their Applications, 31, pp.178~201 (2015), Elsevier BV[DOI]
- G. Falkner, "On the existence of cyclic optimal codes", Atti Sem. Mat. Fis. Univ. Modena, 28(2), pp.326~341 (1979)
- Kenza Guenda, "Construction of cyclic codes over $$\mathbb F _2+u\mathbb F _2$$ F 2 + u F 2 for DNA computing", Applicable Algebra in Engineering, Communication and Computing, 24(6), pp.445~459 (2013), Springer Science and Business Media LLC[DOI]
- J.H. van Lint, "Repeated-root cyclic codes", IEEE Transactions on Information Theory, 37(2), pp.343~345 (1991), Institute of Electrical and Electronics Engineers (IEEE)[DOI]
- Xiusheng LIU, "Cyclic and negacyclic codes of length 2ps over pm+ upm", Acta Mathematica Scientia, 34(3), pp.829~839 (2014), Elsevier BV[DOI]
- R. Roth, "On cyclic MDS codes of length q over GF(q) (Corresp.)", IEEE Transactions on Information Theory, 32(2), pp.284~285 (1986), Institute of Electrical and Electronics Engineers (IEEE)[DOI]
