Let p be an odd prime, q= pm, R= F q+ uF q with u 2= 1, and S= F q+ uF q+ vF q+ uvF q with
u 2= 1, v 2= 1, uv= vu. In this paper, F q RS-cyclic codes over F q RS are studied. As an …

We study the codes of the title by the CRT method, that decomposes such codes into
constituent codes, which are shorter codes over larger alphabets. Criteria on these …

The theory developed for ℤ 2 ℤ 4-additive codes is the starting point for much generalization
about codes over mixed alphabets. They have opened a new, emergent area of …

In this paper, we first discuss linear codes over R and present the decomposition structure of
linear codes over the mixed alphabet F q R, where R= F q+ u F q+ v F q+ uv F q, with u 2= 1 …

Let R= F q+ uF q+ vF q+ uvF q, with u 2= u, v 2= v, uv= vu, where q= pm for a positive integer
m and an odd prime p. We study the algebraic structure of F q R-cyclic codes of block length …

Let p be an odd prime and m be a positive integer, q= p^ mq= pm, R= F _q+ u F _q R= F q+
u F q with u^ 2= uu 2= u, and S= F _q+ u F _q+ v F _q S= F q+ u F q+ v F q with u^ 2= u, v …

In this paper, we construct a class of Z 4 Z 4 Z 4-additive cyclic codes generated by 3-tuples
of polynomials. We discuss their algebraic structure and show that generator matrices can …

The key objective of this paper is to study the cyclic codes over mixed alphabets on the
structure of F q PQ, where P= F q [v]〈 v 3− α 2 2 v〉 and Q= F q [u, v]〈 u 2− α 1 2, v 3− α 2 2 …

In coding theory, the rate and the relative minimum distance are two important invariants to
assess a family of codes' asymptotic characteristics. The relative minimum distance of codes …

In Algebraic Coding Theory, all linear codes are described by generator matrices. Any linear
code has many generator matrices which are equivalent. It is important to find the number of …