Generalizing even-like duadic cyclic codes and Type-II duadic negacyclic codes, we introduce even-like (i.e.,Type-II) and odd-like duadic constacyclic codes, and study their properties and existence. We show that even-like duadic constacyclic codes are isometrically orthogonal, and the duals of even-like duadic constacyclic codes are odd-like duadic constacyclic codes. We exhibit necessary and ...

One of the main challenges of coding theory is to construct linear codes with the best possible parameters. Various algebraic and combinatorial methods along with computer searches are used to construct codes with better parameters. Given the computational complexity of determining the minimum distance of a code, exhaustive searches are not feasible for all but small parameter sets. Therefore, ...

In this paper, we study skew constacyclic codes over the ring ZqR where R = Zq + uZq, q = p s for a prime p and u2 = 0. We give the definition of these codes as subsets of the ring ZqR . Some structural properties of the skew polynomial ring R[x, θ] are discussed, where θ is an automorphism of R. We describe the generator polynomials of skew constacyclic codes over R and ZqR. Using Gray images ...

In this paper, we study the complementary dual codes in more general setting (which are called Galois LCD codes) by a uniform method. A necessary and sufficient condition for linear codes to be Galois LCD codes is determined, and constacyclic codes to be Galois LCD codes are characterized. Some illustrative examples which constacyclic codes are Galois LCD MDS codes are provided as well. In part...

In this paper, we study the structure of cyclic, quasi cyclic, constacyclic codes and their skew codes over the finite ring R. The Gray images of cyclic, quasi cyclic, skew cyclic, skew quasi cyclic and skew constacyclic codes over R are obtained. A necessary and sufficient condition for cyclic (negacyclic) codes over R that contains its dual has been given. The parameters of quantum error corr...

Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields are studied. An algorithm for factorizing xn − λ over Fq2 is given, where λ is a unit in Fq2 . Based on this factorization, the dimensions of the Hermitian hulls of λ-constacyclic codes of length n over Fq2 are determined. The characterization and enumeration of constacyclic Hermitian self-dual (resp., complementary dua...

An significant milestone study in coding theory recognized to be the paper written by Hammons at al. [1]. Fields are useful area for constructing codes but after the study [1] finite ring have received a great deal of attention. Most of the studies are concentrated on the case with codes over finite chain rings. However, optimal codes over nonchain rings exist (e.g see [2].) In [3], et al. stud...

Generalizing Euclidean inner product and Hermitian inner product, we introduce Galois inner products, and study the Galois self-dual constacyclic codes in a very general setting by a uniform method. The conditions for existence of Galois self-dual and isometrically Galois self-dual constacyclic codes are obtained. As consequences, the results on self-dual, iso-dual and Hermitian self-dual const...

In this paper, we study constacyclic codes over Fp+vFp, where p is an odd prime and v = v. The polynomial generators of all constacyclic codes over Fp + vFp are characterized and their dual codes are also determined.

For any prime p, λ-constacyclic codes of length p over R = Fpm + uFpm are precisely the ideals of the local ring Rλ = R[x] 〈xp−λ〉 , where u = 0. In this paper, we first investigate the Hamming distances of cyclic codes of length p over R. The minimum Hamming distances of all cyclic codes of length p over R are determined. Moreover, an isometry between cyclic and α-constacyclic codes of length p...