Cyclic Codes and Self-Dual Codes Over
نویسندگان
چکیده
We introduce linear cyclic codes over the ring F 2 + uF 2 = f0; 1; u; u = u + 1g, where u = 0 and study them by analogy with the Z4 case. We give the structure of these codes on this new alphabet. Self-dual codes of odd length exist as in the case of Z4-codes. Unlike the Z4 case, here free codes are not interesting. Some nonfree codes give rise to optimal binary linear codes and extremal self-dual codes through a linear Gray map.
منابع مشابه
On Euclidean and Hermitian Self-Dual Cyclic Codes over $\mathbb{F}_{2^r}$
Cyclic and self-dual codes are important classes of codes in coding theory. Jia, Ling and Xing [5] as well as Kai and Zhu [7] proved that Euclidean self-dual cyclic codes of length n over Fq exist if and only if n is even and q = 2 , where r is any positive integer. For n and q even, there always exists an [n, n 2 ] self-dual cyclic code with generator polynomial x n 2 + 1 called the trivial se...
متن کاملConstacyclic Codes over Group Ring (Zq[v])/G
Recently, codes over some special finite rings especially chain rings have been studied. More recently, codes over finite non-chain rings have been also considered. Study on codes over such rings or rings in general is motivated by the existence of some special maps called Gray maps whose images give codes over fields. Quantum error-correcting (QEC) codes play a crucial role in protecting quantum ...
متن کاملHermitian Self-Dual Cyclic Codes of Length $p^a$ over $GR(p^2, s)$
In this paper, we study cyclic codes over the Galois ring GR(p, s). The main result is the characterization and enumeration of Hermitian self-dual cyclic codes of length pa over GR(p, s). Combining with some known results and the standard Discrete Fourier Transform decomposition, we arrive at the characterization and enumeration of Euclidean self-dual cyclic codes of any length over GR(p, s). S...
متن کاملConstruction of quasi-cyclic self-dual codes
There is a one-to-one correspondence between l-quasi-cyclic codes over a finite field Fq and linear codes over a ring R = Fq[Y ]/(Y m − 1). Using this correspondence, we prove that every l-quasi-cyclic self-dual code of length ml over a finite field Fq can be obtained by the building-up construction, provided that char (Fq) = 2 or q ≡ 1 (mod 4), m is a prime p, and q is a primitive element of F...
متن کاملSelf-Dual Cyclic and Quantum Codes Over Z2^{\alpha} x (Z2 + uZ2)^{\beta}
In this paper we introduce self-dual cyclic and quantum codes over Zα2 × (Z2 + uZ2) . We determine the conditions for any Z2Z2[u]-cyclic code to be self-dual, that is, C = C. Since the binary image of a selforthogonal Z2Z2[u]-linear code is also a self-orthogonal binary linear code, we introduce quantum codes over Zα2 × (Z2 + uZ2) β . Finally, we present some examples of self-dual cyclic and qu...
متن کامل