Emergent Mind

Abstract

We first define a new Gray map from $R=\mathbb{Z}4+u\mathbb{Z}4$ to $\mathbb{Z}{2}_{4}$, where $u2=1$ and study $(1+2u)$-constacyclic codes over $R$. Also of interest are some properties of $(1+2u)$-constacyclic codes over $R$. Considering their $\mathbb{Z}4$ images, we prove that the Gray images of $(1+2u)$-constacyclic codes of length $n$ over $R$ are cyclic codes of length $2n$ over $\mathbb{Z}4$. In many cases the latter codes have better parameters than those in the online database of Aydin and Asamov. We also give a corrected version of a table of new cyclic $R$-codes published by \"Ozen et al. in Finite Fields and Their Applications, {\bf 38}, (2016) 27-39.

We're not able to analyze this paper right now due to high demand.

Please check back later (sorry!).

Generate a summary of this paper on our Pro plan:

We ran into a problem analyzing this paper.

Newsletter

Get summaries of trending comp sci papers delivered straight to your inbox:

Unsubscribe anytime.