English
Related papers

Related papers: Cyclic codes over some special rings

200 papers

Let $\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$, where $p$ is a prime number and $m$ is a positive integer. Self-dual constacyclic codes of length \( p^s \) over \( \frac{\mathbb{F}_{p^m}[u]}{\langle u^3 \rangle} \) exist only…

Information Theory · Computer Science 2025-01-10 Youssef Ahendouz , Ismail Akharraz

Let $\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$ and $R=\mathbb{F}_{p^m}[u]/\langle u^2\rangle=\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$ $(u^2=0)$, where $p$ is an odd prime and $m$ is a positive integer. For any $\alpha,\beta\in…

Information Theory · Computer Science 2015-11-11 Yuan Cao , Qingguo Li

In this paper, necessary and sufficient conditions for a cyclic code of arbitrary length over the non-chain rings $Z_{4}+\nu Z_{4}$ for $\nu^{2} \in \{0,1,\nu,2\nu,3\nu,2+\nu,2+3\nu,3+2\nu\}$ to be a reversible cyclic code have been…

Information Theory · Computer Science 2023-04-07 Nikita Jain , Sucheta Dutt , Ranjeet Sehmi

The hulls of linear and cyclic codes over finite fields have been of interest and extensively studied due to their wide applications. In this paper, the hulls of cyclic codes of length $n$ over the ring $\mathbb{Z}_4$ have been focused on.…

Information Theory · Computer Science 2019-02-28 Somphong Jitman , Ekkasit Sangwisut , Patanee Udomkavanich

Let $\mathbb{F}_p$ denote the finite field of order $p$, where $p$ is an odd prime. We study certain quantum negacyclic codes over $\mathbb{F}_p$ which we call $t$-Frobenius negacyclic codes. We obtain a criterion for constructing such…

Quantum Physics · Physics 2024-05-01 Priyabrata Bag , Santanu Dey

In network coding, a flag code is a set of sequences of nested subspaces of $\mathbb{F}_q^n$, being $\mathbb{F}_q$ the finite field with $q$ elements. Flag codes defined as orbits of a cyclic subgroup of the general linear group acting on…

Information Theory · Computer Science 2021-02-02 Clementa Alonso-González , Miguel Ángel Navarro-Pérez

In this article, we study skew constacyclic codes over a class of finite commutative semisimple rings. The automorphism group of $\mathcal{R}=\prod_{i=1}^t F_q$ is determined, and we characterize skew constacyclic codes over ring by linear…

Information Theory · Computer Science 2022-06-06 Ying Zhao

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…

Number Theory · Mathematics 2016-09-27 Mokshi Goyal , Madhu Raka

Quasi-cyclic codes form an important class of algebraic codes that includes cyclic codes as a special subclass. This chapter focuses on the algebraic structure of quasi-cyclic codes, first. Based on these structural properties, some…

Information Theory · Computer Science 2020-12-10 Cem Güneri , San Ling , Buket Özkaya

We introduce a class of cyclic quantum codes, basing the construction not on the simplicity of the stabilizers, but rather on the simplicity of preparation of a code state (at least in the absence of noise). We show how certain known codes,…

Quantum Physics · Physics 2025-10-21 Matthew B. Hastings

Cyclic and self-dual codes are important classes of codes in coding theory. Jia, Ling and Xing \cite{Jia} as well as Kai and Zhu \cite{Kai} proved that Euclidean self-dual cyclic codes of length $n$ over $\mathbb{F}_q$ exist if and only if…

Information Theory · Computer Science 2016-03-14 Odessa D. Consorte , Lilibeth D. Valdez

Let $p$ be a prime number and $\varsigma$ and $m$ be a positive integers. Let $\mathcal{R} = \mathbb{F}_{2^m} + u\mathbb{F}_{2^m} + u^2\mathbb{F}_{2^m}$ ($u^3 = 0$). Cyclic codes of length $2^\varsigma$ over $\mathcal{R}$ are precisely the…

Combinatorics · Mathematics 2025-09-05 Divya Acharya , Prasanna Poojary , Vadiraja Bhatta G R

Let $f(u)$ and $g(v)$ be two polynomials of degree $k$ and $\ell$ respectively, not both linear, which split into distinct linear factors over $\mathbb{F}_{q}$. Let $\mathcal{R}=\mathbb{F}_{q}[u,v]/\langle f(u),g(v),\\uv-vu\rangle$ be a…

Information Theory · Computer Science 2019-05-31 Swati Bhardwaj , Madhu Raka

We study the (variable-length) codes of the form X u {a^n}, where X c a*wa* and |X| = n. We extend various notions and results from factorizations of cyclic groups theory to this type of codes. In particular, when n is the product of at…

Combinatorics · Mathematics 2023-02-01 Christophe Cordero

In this paper, we investigate polycyclic codes associated with a trinomial of arbitrary degree $n$ over a finite chain ring $ R.$ We extend the concepts of $ n $-isometry and $ n $-equivalence known for constacyclic codes to this class of…

Information Theory · Computer Science 2025-03-18 Abdelghaffar Chibloun , Hassan Ou-azzou , Edgar Martínez-Moro , Mustapha Najmeddine

The aim of this paper is to determine the algebraic structure of multidimensional cyclic codes over a finite chain ring $\mathfrak{R}$. An algorithm to find the generator polynomials of $n$ dimensional ($n$D) cyclic codes of length…

Information Theory · Computer Science 2023-03-15 Disha , Sucheta Dutt

The purpose of this article is to study polycyclic codes over the ring $\frac{\mathbb{F}_{p^m}[u]}{\langle u^t \rangle}, \,t \geq 1$, and their associated torsion codes. It is shown that if $\phi$ is a surjective ring homomorphism from a…

Information Theory · Computer Science 2026-04-07 Akanksha Tiwari , Pramod Kanwar , Ritumoni Sarma

We consider codes defined over an affine algebra $\mathcal A=R[X_1,\dots,X_r]/\left\langle t_1(X_1),\dots,t_r(X_r)\right\rangle$, where $t_i(X_i)$ is a monic univariate polynomial over a finite commutative chain ring $R$. Namely, we study…

Information Theory · Computer Science 2017-09-19 E. Martínez-Moro , A. Piñera-Nicolás , I. F. Rúa

We propose constructions of codes over quotient rings of Eisenstein integers equipped with the Euclidean, square Euclidean, and hexagonal distances as a generalization of codes over Eisenstein integer fields. By set partitioning, we…

Information Theory · Computer Science 2025-08-28 Abdul Hadi , Uha Isnaini , Indah Emilia Wijayanti , Martianus Frederic Ezerman

Let $\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $R=\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}$ $(u^2=0)$ and $s,n$ be positive integers such that $n$ is odd. In this paper, we give an explicit representation for every self-dual…

Information Theory · Computer Science 2019-07-17 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Fang-Wei Fu , Fanghui Ma
‹ Prev 1 4 5 6 7 8 10 Next ›