Search

Conjucyclic codes were first introduced by Calderbank, Rains, Shor and Sloane in [ 1 ] because of their applications in quantum error-correction. In this paper, we study linear and additive conjucyclic codes over the finite field F 4 F 4 and produce a duality for which the orthogonal, with respect to that duality, of conjucyclic codes is conjucyclic. Moreover, we show that this is not the case for other standard dualities. We show that additive conjucyclic codes are the only non-trivial conjucyclic codes over F 4 F 4 and we use a linear algebraic approach to classify these codes. We will also show that additive conjucyclic codes of length n n over F 4 F 4 are isomorphic to binary cyclic codes of length 2 n. 2 n. [ABSTRACT FROM AUTHOR]

In this paper, we study the structure and properties of additive right and left polycyclic codes induced by a binary vector $ a $ in $ \mathbb{F}_{2}^{n}. $ We find the generator polynomials and the cardinality of these codes. We also study different duals for these codes. In particular, we show that if $ C $ is a right polycyclic code induced by a vector $ a\in \mathbb{F}_{2}^{n} $, then the Hermitian dual of $ C $ is a sequential code induced by $ a. $ As an application of these codes, we present examples of additive right polycyclic codes over $ \mathbb{F}_{4} $ with more codewords than comparable optimal linear codes as well as optimal binary linear codes and optimal quantum codes obtained from additive right polycyclic codes over $ \mathbb{F}_{4}. $ [ABSTRACT FROM AUTHOR]

In this paper, we introduce self-dual cyclic codes over the ring ℤ 2 × (ℤ 2 + u ℤ 2) = ℤ 2 ℤ 2 [ u ]. We determine the conditions for any ℤ 2 ℤ 2 [ u ] -cyclic code to be self-dual, that is, 𝒞 = 𝒞 ⊥ . Since the binary image of a self-orthogonal ℤ 2 ℤ 2 [ u ] -linear code is also a self-orthogonal binary linear code, we introduce quantum codes over ℤ 2 ℤ 2 [ u ]. Finally, we present some examples of self-dual cyclic and quantum codes that have good parameters. [ABSTRACT FROM AUTHOR]

ℤ 2 ℤ 2 s -additive codes for any integer s > 1 are considered as codes over mixed alphabets. They are a generalization of binary linear codes and linear codes over ℤ 2 s . In this paper, we are interested in studying ℤ 2 ℤ 2 s -additive cyclic codes. We will give the generator polynomials of these codes. We will also give the minimal spanning sets for these codes. We will define separable ℤ 2 ℤ 2 s -additive codes and provide conditions on the generator polynomials for a ℤ 2 ℤ 2 s -additive cyclic code to be separable. Finally, we present some examples of optimal parameter binary codes obtained as images of ℤ 2 ℤ 8 -additive cyclic codes. [ABSTRACT FROM AUTHOR]

Following the very recent studies on \mathbb Z2\mathbb Z4 -additive codes, \mathbb Z2\mathbb Z2[u] -linear codes have been introduced by Aydogdu et al. In this paper, we introduce and study the algebraic structure of cyclic, constacyclic codes and their duals over the R -module \mathbb {Z}_{2}^\alpha R^\beta where R=\mathbb {Z}_{2}+u\mathbb {Z}_{2}=\left \{{0,1,u,u+1}\right \} is the ring with four elements and u^2=0 . We determine the generating independent sets and the types and sizes of both such codes and their duals. Finally, we present a bound and an optimal family of codes attaining this bound and also give some illustrative examples of binary codes that have good parameters which are obtained from the cyclic codes in \mathbb Z_2^\alpha R^\beta . [ABSTRACT FROM AUTHOR]

In this paper, we study \BBZ2\BBZ4-additive cyclic codes. These codes are identified as \BBZ4[x]-submodules of the ring Rr,s=\BBZ2[x]/\langle x^{r}-1\rangle\times\BBZ4\left[x\right]/\langle x^{s}-1\rangle. The algebraic structure of this family of codes is studied and a set of generator polynomials for this family as a \BBZ4[x]-submodule of the ring Rr,s is determined. We show that the duals of \BBZ2\BBZ4-additive cyclic codes are also cyclic. We also present an infinite family of Maximum Distance separable with respect to the singleton bound codes. Finally, we obtain a number of binary linear codes with optimal parameters from the \BBZ2\BBZ4-additive cyclic codes. [ABSTRACT FROM AUTHOR]

In this paper, we are interested in finding an algebraic structure of conjucyclic codes of length n over the finite field F 4. We show that conjucyclic codes of length n over F 4 are related to binary cyclic codes of length 2 n and show that there is a canonical bijective correspondence between the two sets. We illustrate how the factorization of the polynomial x 2 n + 1 plays a critical role in each setting. Moreover, we construct the generator and parity check matrices of conjucyclic codes of length n over F 4. [ABSTRACT FROM AUTHOR]