On Cyclic and Negacyclic Codes of Length 8ps Over Fpm + uFpm

2020 ◽  
Vol 87 (3-4) ◽  
pp. 231
Author(s):  
Saroj Rani

In this paper, we establish the algebraic structure of all cyclic and negacyclic codes of length 8<em>p</em><sup>s</sup> over the chain ring Fp<sup>m</sup> + uFp<sup>m</sup> in terms of their generator polynomials, where u<sup>2</sup> = 0 and s is a positive integer and p is an odd prime. We also find out the number of codewords in each of these cyclic codes. Besides this, we determine duals of cyclic codes and list self-dual cyclic and negacyclic codes of length 8<em>p</em><sup>s</sup> over Fp<sup>m</sup> + uFp<sup>m</sup>. Also, we determine μ and -constacyclic codes of length 8<em>p</em><sup>s</sup> over Fp<sup>m</sup> + uFp<sup>m</sup>.

Author(s):  
Teeramet Inchaisri ◽  
Jirayu Phuto ◽  
Chakkrid Klin-Eam

In this paper, we focus on the algebraic structure of left negacyclic codes of length [Formula: see text] over the finite non-commutative chain ring [Formula: see text] where [Formula: see text] is an automorphism on [Formula: see text]. After that, the number of codewords of all left negacyclic codes is obtained. For each left negacyclic code, we also obtain the structure of its right dual code. In the remaining result, the number of distinct left negacyclic codes is given. Finally, a one-to-one correspondence between left negacyclic and left [Formula: see text]-constacyclic codes of length [Formula: see text] over [Formula: see text] is constructed via ring isomorphism, which carries over the results regarding left negacyclic codes corresponding to left [Formula: see text]-constacyclic codes of length [Formula: see text] over [Formula: see text] where [Formula: see text] is a nonzero element of the field [Formula: see text] such that [Formula: see text].


2021 ◽  
Vol 28 (04) ◽  
pp. 581-600
Author(s):  
Hai Q. Dinh ◽  
Hualu Liu ◽  
Roengchai Tansuchat ◽  
Thang M. Vo

Negacyclic codes of length [Formula: see text] over the Galois ring [Formula: see text] are linearly ordered under set-theoretic inclusion, i.e., they are the ideals [Formula: see text], [Formula: see text], of the chain ring [Formula: see text]. This structure is used to obtain the symbol-pair distances of all such negacyclic codes. Among others, for the special case when the alphabet is the finite field [Formula: see text] (i.e., [Formula: see text]), the symbol-pair distance distribution of constacyclic codes over [Formula: see text] verifies the Singleton bound for such symbol-pair codes, and provides all maximum distance separable symbol-pair constacyclic codes of length [Formula: see text] over [Formula: see text].


Filomat ◽  
2017 ◽  
Vol 31 (10) ◽  
pp. 2917-2923
Author(s):  
Mehmet Koroglu ◽  
Irfan Siap

Constacyclic codes are preferred in engineering applications due to their efficient encoding process via shift registers. The class of constacyclic codes contains cyclic and negacyclic codes. The relation and presentation of cyclic codes as group algebras has been considered. Here for the first time, we establish a relation between constacyclic codes and group algebras and study their algebraic structures. Further, we give a method for constructing constacyclic codes by using zero-divisors in group algebras. Some good parameters for constacyclic codes which are derived from the proposed construction are also listed.


2019 ◽  
Vol 19 (06) ◽  
pp. 2050103 ◽  
Author(s):  
Yonglin Cao ◽  
Yuan Cao ◽  
Hai Q. Dinh ◽  
Fang-Wei Fu ◽  
Jian Gao ◽  
...  

Let [Formula: see text] be a finite field of cardinality [Formula: see text], where [Formula: see text] is an odd prime, [Formula: see text] be positive integers satisfying [Formula: see text], and denote [Formula: see text], where [Formula: see text] is an irreducible polynomial in [Formula: see text]. In this note, for any fixed invertible element [Formula: see text], we present all distinct linear codes [Formula: see text] over [Formula: see text] of length [Formula: see text] satisfying the condition: [Formula: see text] for all [Formula: see text]. This conclusion can be used to determine the structure of [Formula: see text]-constacyclic codes over the finite chain ring [Formula: see text] of length [Formula: see text] for any positive integer [Formula: see text] satisfying [Formula: see text].


2018 ◽  
Vol 17 (09) ◽  
pp. 1850173 ◽  
Author(s):  
Hai Q. Dinh ◽  
Anuradha Sharma ◽  
Saroj Rani ◽  
Songsak Sriboonchitta

Let [Formula: see text] be the finite field of order [Formula: see text] where [Formula: see text] is an odd prime and [Formula: see text] is a positive integer. In this paper, we determine the algebraic structures of all cyclic and negacyclic codes of length [Formula: see text] over the finite commutative chain ring [Formula: see text] where [Formula: see text] and [Formula: see text] is a positive integer. We also obtain the number of codewords in each of these codes. Among others, we establish the duals of all such codes and derive some self-dual cyclic and negacyclic codes of length [Formula: see text] over [Formula: see text]


2018 ◽  
Vol 10 (03) ◽  
pp. 1850036 ◽  
Author(s):  
Anuradha Sharma ◽  
Tania Sidana

Let [Formula: see text] be a prime, [Formula: see text] be a positive integer, and let GR[Formula: see text] be the Galois ring of characteristic [Formula: see text] and cardinality [Formula: see text]. In this paper, all repeated-root constacyclic codes of arbitrary lengths over GR[Formula: see text] their sizes and their dual codes are determined. As an application, some isodual constacyclic codes over GR[Formula: see text] are also listed. To illustrate the results, all cyclic and negacyclic codes of length 10 over [Formula: see text] are obtained.


2021 ◽  
Vol 14 (3) ◽  
pp. 1082-1097
Author(s):  
Jagbir Singh ◽  
Prateek Mor ◽  
Shikha . ◽  
Meena .

This paper is concerned with, structural properties and construction of quantum codes over Z3 by using constacyclic codes over the finite commutative non-chain ring R = Z3 + νZ3 + ωZ3 + νωZ3 where ν2 = 1, ω2 = ω, νω = νω, and Z3 is field having 3 elements with characteristic 3. A Gray map is defined between R and Z43. The parameters of quantum codes over Z3 are obtained by decomposing constacyclic codes into cyclic and negacyclic codes over Z3. As an application, some examples of quantum codes of arbitrary length, are also obtained.


Filomat ◽  
2019 ◽  
Vol 33 (8) ◽  
pp. 2237-2248 ◽  
Author(s):  
Habibul Islam ◽  
Om Prakash

In this paper, we study (1 + 2u + 2v)-constacyclic and skew (1 + 2u + 2v)-constacyclic codes over the ring Z4 + uZ4 + vZ4 + uvZ4 where u2 = v2 = 0,uv = vu. We define some new Gray maps and show that the Gray images of (1 + 2u + 2v)-constacyclic and skew (1 + 2u + 2v)-constacyclic codes are cyclic, quasi-cyclic and permutation equivalent to quasi-cyclic codes over Z4. Further, we determine the structure of (1 + 2u + 2v)-constacyclic codes of odd length n.


2021 ◽  
Vol 0 (0) ◽  
pp. 0
Author(s):  
Ram Krishna Verma ◽  
Om Prakash ◽  
Ashutosh Singh ◽  
Habibul Islam

<p style='text-indent:20px;'>For an odd prime <inline-formula><tex-math id="M1">\begin{document}$ p $\end{document}</tex-math></inline-formula> and positive integers <inline-formula><tex-math id="M2">\begin{document}$ m $\end{document}</tex-math></inline-formula> and <inline-formula><tex-math id="M3">\begin{document}$ \ell $\end{document}</tex-math></inline-formula>, let <inline-formula><tex-math id="M4">\begin{document}$ \mathbb{F}_{p^m} $\end{document}</tex-math></inline-formula> be the finite field with <inline-formula><tex-math id="M5">\begin{document}$ p^{m} $\end{document}</tex-math></inline-formula> elements and <inline-formula><tex-math id="M6">\begin{document}$ R_{\ell,m} = \mathbb{F}_{p^m}[v_1,v_2,\dots,v_{\ell}]/\langle v^{2}_{i}-1, v_{i}v_{j}-v_{j}v_{i}\rangle_{1\leq i, j\leq \ell} $\end{document}</tex-math></inline-formula>. Thus <inline-formula><tex-math id="M7">\begin{document}$ R_{\ell,m} $\end{document}</tex-math></inline-formula> is a finite commutative non-chain ring of order <inline-formula><tex-math id="M8">\begin{document}$ p^{2^{\ell} m} $\end{document}</tex-math></inline-formula> with characteristic <inline-formula><tex-math id="M9">\begin{document}$ p $\end{document}</tex-math></inline-formula>. In this paper, we aim to construct quantum codes from skew constacyclic codes over <inline-formula><tex-math id="M10">\begin{document}$ R_{\ell,m} $\end{document}</tex-math></inline-formula>. First, we discuss the structures of skew constacyclic codes and determine their Euclidean dual codes. Then a relation between these codes and their Euclidean duals has been obtained. Finally, with the help of a duality-preserving Gray map and the CSS construction, many MDS and better non-binary quantum codes are obtained as compared to the best-known quantum codes available in the literature.</p>


2020 ◽  
Vol 70 (6) ◽  
pp. 626-632
Author(s):  
Om Prakash ◽  
Shikha Yadav ◽  
Ram Krishna Verma

This article discusses linear complementary dual (LCD) codes over ℜ = Fq+uFq(u2=1) where q is a power of an odd prime p. Authors come up with a new Gray map from ℜn to F2nq and define a new class of codes obtained as the gray image of constacyclic codes over .ℜ Further, we extend the study over Euclidean and Hermitian LCD codes and establish a relation between reversible cyclic codes and Euclidean LCD cyclic codes over ℜ. Finally, an application of LCD codes in multisecret sharing scheme is given.


Sign in / Sign up

Export Citation Format

Share Document