Related papers: Constacyclic Codes over $F_p+vF_p$

Let $m\geq 2$ be any natural number and let $\mathcal{R}=\mathbb{F}_{p}+u\mathbb{F}_{p}+u^2\mathbb{F}_{p}+\cdots+u^{m-1}\mathbb{F}_{p}$ be a finite non-chain ring, where $u^m=u$ and $p$ is a prime congruent to $1$ modulo $(m-1)$. In this…

In this work, we study cyclic codes that have generators as Fibonacci polynomials over finite fields. We show that these cyclic codes in most cases produce families of maximum distance separable and optimal codes with interesting…

Let $p$ be an odd prime. In the paper we collect the author's various conjectures on congruences modulo $p$ or $p^2$, which are concerned with sums of binomial coefficients, Lucas sequences, power residues and special binary quadratic…

Let $\mathcal{R}_e$ be a finite commutative chain ring with nilpotency index $e \geq 2.$ In this paper, all repeated-root constacyclic codes of arbitrary lengths over $\mathcal{R}_{2},$ their sizes and their dual codes are determined. As an…

Let $\mathbb F_q$ be a finite field, where $q$ is an odd prime power. Let $R=\mathbb{F}_q+u\mathbb{F}_q+v\mathbb{F}_q+uv\mathbb F_q$ with $u^2=u,v^2=v,uv=vu$. In this paper, we study the algebraic structure of $(\theta, \Theta)$-cyclic…

A binary linear code $C$ is a $\mathbb{Z}_2$-double cyclic code if the set of coordinates can be partitioned into two subsets such that any cyclic shift of the coordinates of both subsets leaves invariant the code. These codes can be…

Let $p$ be a prime integer, $n,s\geq 2$ be integers satisfying ${\rm gcd}(p,n)=1$, and denote $R=\mathbb{Z}_{p^s}[v]/\langle v^2-pv\rangle$. Then $R$ is a local non-principal ideal ring of $p^{2s}$ elements. First, the structure of any…

This work introduces a method for constructing polyphase alternating codes in which the length of a code transmission cycle can be $p^m$ or $p-1$, where $p$ is a prime number and $m$ is a positive integer. The relevant properties leading to…

As a generalization of cyclic codes of length p^s over F_{p^a}, we study n-dimensional cyclic codes of length p^{s_1} X ... X p^{s_n} over F_{p^a} generated by a single "monomial". Namely, we study multi-variable cyclic codes of the form…

In this work, we study the structure of cyclic DNA codes of arbitrary lengths over the ring R=F2+uF2+vF2+uvF2 and establish relations to codes over R1=F2+uF2 by defining a Gray map between R and R1^2 where R1 is the ring with 4 elements.…

Let $R=\mathbb{Z}_4+u\mathbb{Z}_4,$ where $\mathbb{Z}_4$ denotes the ring of integers modulo $4$ and $u^2=0$. In the present paper, we introduce a new Gray map from $R^n$ to $\mathbb{Z}_{4}^{2n}.$ We study $(1+2u)$-constacyclic codes over…

We introduce circulant matrices that capture the structure of a skew-polynomial ring F[x;\theta] modulo the left ideal generated by a polynomial of the type x^n-a. This allows us to develop an approach to skew-constacyclic codes based on…

Additive cyclic codes over Galois rings were investigated in previous works. In this paper, we investigate the same problem but over a more general ring family, finite commutative chain rings. When we focus on non-Galois finite commutative…

In this paper we study Z2Z4Z8-additive codes, which are the extension of recently introduced Z2Z4-additive codes. We determine the standard forms of the generator and parity-check matrices of Z2Z4Z8-additive codes. Moreover, we investigate…

Let $m$, $k$ be positive integers such that $\frac{m}{\gcd(m,k)}\geq 3$, $p$ be an odd prime and $\pi $ be a primitive element of $\mathbb{F}_{p^m}$. Let $h_1(x)$ and $h_2(x)$ be the minimal polynomials of $-\pi^{-1}$ and…

Let $\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $R=\mathbb{F}_{2^m}[u]/\langle u^4\rangle)$ and $n$ is an odd positive integer. For any $\delta,\alpha\in \mathbb{F}_{2^m}^{\times}$, ideals of the ring $R[x]/\langle…

Linear codes have been an interesting topic in both theory and practice for many years. In this paper, for an odd prime $p$, we determine the explicit complete weight enumerators of two classes of linear codes over $\mathbb{F}_p$ and they…

Let $\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $\lambda$ and $k$ be integers satisfying $\lambda,k\geq 2$ and denote $R=\mathbb{F}_{2^m}[u]/\langle u^{2\lambda}\rangle$. Let $\delta,\alpha\in \mathbb{F}_{2^m}^{\times}$. For…

In this paper, we have studied cyclic codes over the ring $R=\mathbb{Z}_4+u\mathbb{Z}_4$, $u^2=0$. We have considered cyclic codes of odd lengths. A sufficient condition for a cyclic code over $R$ to be a $\mathbb{Z}_4$-free module is…

Codes over Galois rings have been studied extensively during the last three decades. Negacyclic codes over $GR(2^a,m)$ of length $2^s$ have been characterized: the ring $\mathcal{R}_2(a,m,-1)= \frac{GR(2^a,m)[x]}{\langle x^{2^s}+1\rangle}$…