English
Related papers

Related papers: On ZpZp[u, v]-additive cyclic and constacyclic cod…

200 papers

Let $\mathbb{F}_{p^{m}}$ be a finite field with cardinality $p^{m}$ and $R=\mathbb{F}_{p^{m}}+u\mathbb{F}_{p^{m}}$ with $u^{2}=0$. We aim to determine all $\alpha+u\beta$-constacyclic codes of length $np^{s}$ over $R$, where…

Information Theory · Computer Science 2016-06-22 Wei Zhao , Xilin Tang , Ze Gu

Let $\mathbb{F}_p$ be a finite field and $u$ be an indeterminate. This article studies $(1-2u^2)$-constacyclic codes over the ring $\mathbb{F}_p+u\mathbb{F}_p+u^2\mathbb{F}_p$, where $u^3=u$. We describe generator polynomials of this kind…

Information Theory · Computer Science 2015-06-25 Hojjat Mostafanasab , Negin Karimi

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…

Information Theory · Computer Science 2015-01-08 Rama Krishna Bandi , Maheshanand Bhaintwal

In this paper, two different Gray-like maps from $Z_p^\alpha\times Z_{p^k}^\beta$, where $p$ is prime, to $Z_p^n$, $n={\alpha+\beta p^{k-1}}$, denoted by $\phi$ and $\Phi$, respectively, are presented. We have determined the connection…

Information Theory · Computer Science 2020-02-18 Minjia Shi , Rongsheng Wu , Denis S. Krotov

Let k be an arbitrary element of a finite commutative chain ring R and u be a unit in R. In this work, we present necessary conditions which are sufficient as well for a cyclic code to be a (u,k) reversible complement code over R. Using…

Information Theory · Computer Science 2023-08-02 Monika Dalal , Sucheta Dutt , Ranjeet Sehmi

In this paper, we study the structure of cyclic, quasi-cyclic, constacyclic codes and their skew codes over the finite ring R=Z_3+vZ_3+v^2Z_3, v^3=v. The Gray images of cyclic, quasi-cyclic, skew cyclic, skew quasi-cyclic and skew…

Information Theory · Computer Science 2018-11-09 Abdullah Dertli , Yasein Cengellenmis , Senol Eren

Let $q$ be a power of a prime $p$. In this paper, we study reversible cyclic codes of arbitrary length over the ring $ R = \mathbb{F}_q + u \mathbb{F}_q$, where $u^2=0 mod q$. First, we find a unique set of generators for cyclic codes over…

Information Theory · Computer Science 2019-10-16 Om Prakash , Shikha Patel , Shikha Yadav

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…

Rings and Algebras · Mathematics 2015-04-15 Mohammad Ashraf , Ghulam Mohammad

In this article, we study the skew cyclic codes over R_{k}=F_{p}+uF_{p}+\dots +u^{k-1}F_{p} of length n. We characterize the skew cyclic codes of length $n$ over R_{k} as free left R_{k}[x;\theta]-submodules of R_{k}[x;\theta]/\langle…

Information Theory · Computer Science 2018-02-26 Om Prakash , Habibul Islam

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

Information Theory · Computer Science 2013-01-07 Guanghui Zhang , Bocong Chen

In this paper, we investigate cyclic codes over the ring $ \mathbb{F}_p[u,v,w]\langle u^2,$ $v^2, w^2$, $uv-vu, vw-wv, uw-wu \rangle$, where $p$ is a prime number. Which is a part of family of Frobenius rings. We find a unique set of…

Information Theory · Computer Science 2015-09-30 Pramod Kumar Kewat , Sarika Kushwaha

In this paper, we describe linear and cyclic codes over the rings of the form $R_{s,p}=\mathbb{Z}_{p}[u]/\left( f\left(u\right) /\left( u-s\right) \right)$, where $p$ is a prime number and $f\left( u\right) =u^{p}-u$, with $s\in…

Information Theory · Computer Science 2026-05-28 Cristina Flaut , Bianca Liana Bercea-Straton

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…

Information Theory · Computer Science 2014-10-22 Joaquim Borges , Cristina Fernández-Córdoba , Roger Ten-Valls

In this paper skew constacyclic codes over finite non-chain ring R = F_q+uF_q+vF_q, where q= p^m, p is an odd prime and u^{2}=u, v^{2}=v, uv = vu = 0 are studied. We show that Gray image of a skew alpha-constacyclic cyclic code of length n…

Information Theory · Computer Science 2017-12-11 Habibul Islam , Om Prakash

In the present paper, we study skew cyclic codes over the ring $F_{q}+vF_{q}+v^2F_{q}$, where $v^3=v,~q=p^m$ and $p$ is an odd prime. We investigate the structural properties of skew cyclic codes over $F_{q}+vF_{q}+v^2F_{q}$ using…

Information Theory · Computer Science 2015-04-17 Mohammad Ashraf , Ghulam Mohammad

It's well known that the quadratic residue code over finite fields is an interesting class of cyclic codes for its higher minimum distance. Let $g$ be a positive integer and $p,p_{1},\ldots, p_{g}$ be distinct odd primes, the present paper…

Number Theory · Mathematics 2020-01-08 Qunying Liao , Yuanbo Liu

Classical Goppa codes are a well-known class of codes with applications in code-based cryptography, which are a special case of alternant codes. Many papers are devoted to the search for Goppa codes with a cyclic extension or with a cyclic…

Information Theory · Computer Science 2024-05-29 Xue Jia , Fengwei Li , Huan Sun , Qin Yue

We investigate additive cyclic codes over the alphabet $\mathbb{F}_{q}\mathbb{F}_{q^2}$, where $q$ is a prime power. First, its generator polynomials and minimal spanning set are determined. Then, examples of $\mathbb{F}_{q^2}$-additive…

Information Theory · Computer Science 2025-11-05 Ankit Yadav , Ritumoni Sarma

This study aims to determine the algebraic structures of $\alpha$-constacyclic codes of length $3p^s$ over the finite commutative non-chain ring $\mathcal{R}=\frac{\mathbb{F}_{p^m}[u, v]}{\langle u^2, v^2, uv-vu\rangle}$, for a prime $p…

Combinatorics · Mathematics 2025-04-03 Divya Acharya , Prasanna Poojary , Vadiraja Bhatta G R

We study constacyclic codes, of length $np^s$ and $2np^s$, that are generated by the polynomials $(x^n + \gamma)^{\ell}$ and $(x^n - \xi)^i(x^n + \xi)^j$\ respectively, where $x^n + \gamma$, $x^n - \xi$ and $x^n + \xi$ are irreducible over…

Information Theory · Computer Science 2009-06-23 Hakan Ozadam , Ferruh Ozbudak