English
Related papers

Related papers: Skew Cyclic Codes Over $\mathbb{F}_4 R$

200 papers

Two new classes of skew codes over a finite field $\F$ are proposed, called skew convolutional codes and skew trellis codes. These two classes are defined by, respectively, left or right sub-modules over the skew fields of fractions of skew…

Information Theory · Computer Science 2021-02-03 Vladimir Sidorenko , Wenhui Li , Onur Günlü , Gerhard Kramer

In this work, cyclic-skew-cyclic codes and sum-rank BCH codes are introduced. Cyclic-skew-cyclic codes are characterized as left ideals of a suitable non-commutative finite ring, constructed using skew polynomials on top of polynomials (or…

Information Theory · Computer Science 2021-06-09 Umberto Martínez-Peñas

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…

Information Theory · Computer Science 2024-04-02 Awadhesh Kumar Shukla , Sachin Pathak , Om Prakash Pandey , Vipul Mishra , Ashish Kumar Upadhyay

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

Information Theory · Computer Science 2018-11-06 Mokshi Goyal , Madhu Raka

Let $m \geq 2$ be an integer, and let $\mathbb{F}_q$ be the finite field of prime power order $q.$ Let $\mathcal{R}=\frac{\mathbb{F}_q[u]}{\langle u^2 \rangle}\times \mathbb{F}_q$ be the mixed-alphabet ring, where…

Information Theory · Computer Science 2025-12-29 Leijo Jose , Lavanya G. , Anuradha Sharma

We investigate linear codes over the ring $\mathbb{Z}_4 + u\mathbb{Z}_4 + v\mathbb{Z}_4 + w\mathbb{Z}_4 + uv\mathbb{Z}_4 + uw\mathbb{Z}_4 + vw\mathbb{Z}_4 + uvw\mathbb{Z}_4$, with conditions $u^2=u$, $v^2=v$, $w^2=w$, $uv=vu$, $uw=wu$ and…

Information Theory · Computer Science 2019-04-26 Bustomi , Aditya Purwa Santika , Djoko Suprijanto

Research on codes over finite rings has intensified since the discovery in 1994 of the fact that some best binary non-linear codes can be obtained as images of $\mathbb{Z}_4$-linear codes. Codes over many different finite rings has been a…

Information Theory · Computer Science 2022-08-16 Nuh Aydin , Yiang Lu , Vishad R. Onta

A linear code of length $n$ over a finite chain ring $R$ with residue field $\F_q$ is a $R$-submodule of $R^n$. A $R$-linear code is a code over $\F_q$ (not necessarily linear) which is the generalized Gray map image of a linear code over…

Information Theory · Computer Science 2025-12-03 Cristina Fernández-Córdoba , Sergi Sánchez-Aragón , Mercè Villanueva

We propose a variation of Construction A of lattices from linear codes defined using the quotient $\Lambda/\mathfrak p\Lambda$ of some order $\Lambda$ inside a cyclic division $F$-algebra, for $\mathfrak p$ a prime ideal of a number field…

Information Theory · Computer Science 2015-06-22 Jérôme Ducoat , Frédérique Oggier

In this article we see quasi-cyclic codes as block cyclic codes. We generalize some properties of cyclic codes to quasi-cyclic ones such as generator polynomials and ideals. Indeed we show a one-to-one correspondence between l-quasi-cyclic…

Information Theory · Computer Science 2012-05-30 Morgan Barbier , Christophe Chabot , Guillaume Quintin

Let $R=\mathbb{F}_{2^{m}}+u\mathbb{F}_{2^{m}}+\cdots+u^{k}\mathbb{F}_{2^{m}}$ , where $\mathbb{F}_{2^{m}}$ is a finite field with $2^{m}$ elements, $m$ is a positive integer, $u$ is an indeterminate with $u^{k+1}=0.$ In this paper, we…

Information Theory · Computer Science 2016-08-25 Yongsheng Tang , Shixin Zhu , Xiaoshan Kai , Jian Ding

Let \(\cU\) be the multiplicative group of order~\(n\) in the splitting field \(\bbF_{q^m}\) of \(x^n-1\) over the finite field \(\bbF_q\). Any map of the form \(x\rightarrow cx^t\) with \(c\in \cU\) and \(t=q^i\), \(0\leq i<m\), is…

Information Theory · Computer Science 2022-02-17 Henk D. L. Hollmann

We study $\Theta_S-$cyclic codes over the family of rings $A_k.$ We characterize $\Theta_S-$cyclic codes in terms of their binary images. A family of Hermitian inner-products is defined and we prove that if a code is $\Theta_S-$cyclic then…

We study cyclic codes with arbitrary length over Fp+vFp where theta(v)=av, a in Fp and v^2=0. We characterize all existing codes in case of O(theta)|n by using certain projections from (Fp+vFp)[x;theta] to Fp[x]. We provide an explicit…

Rings and Algebras · Mathematics 2016-07-06 Reza Dastbasteh , Seyyed Hamed Mousavi , Javad Haghighat

The results of J. F. Qiann et al. [4] on $(1-\gamma)$-cyclic codes over finite chain rings of nilpotency index 2 are extended to $(1-\gamma^e)$-cyclic codes over finite chain rings of arbitrary nilpotency index $e+1$. The Gray map is…

Rings and Algebras · Mathematics 2009-10-02 Somphong Jitman , Patanee Udomkavanich

This work studies skew polycyclic codes over finite chain rings defined by central trinomials. For this class of codes, we investigate Hamming equivalence in the non-commutative (skew) setting. We introduce an equivalence relation on the…

Information Theory · Computer Science 2026-05-06 Maryam Bajalan , Edgar Martínez-Moro , Hassan Ou-azzou

In this work, we study a class of generalized quasi-cyclic (GQC) codes called skew GQC codes. By the factorization theory of ideals, we give the Chinese Remainder Theorem over the skew polynomial ring, which leads to a canonical…

Information Theory · Computer Science 2013-09-09 Jian Gao , Linzhi Shen , Fang-Wei Fu

In this paper, we give some characterizations of the ring $R[x,y,\rho,\theta]$ where R is a commutative ring. We investigate 2-D skew $(\lambda_1,\lambda_2)$-constacyclic codes.

Rings and Algebras · Mathematics 2017-01-03 Hojjat Mostafanasab

Conjucyclic codes are part of a family of codes that includes cyclic, constacyclic, and quasi-cyclic codes, among others. Despite their importance in quantum error correction, they have not received much attention in the literature. This…

Information Theory · Computer Science 2023-09-06 Md Ajaharul Hossain , Ramakrishna Bandi

A locally recoverable code of locality $r$ over $\mathbb{F}_{q}$ is a code where every coordinate of a codeword can be recovered using the values of at most $r$ other coordinates of that codeword. Locally recoverable codes are efficient at…

Information Theory · Computer Science 2024-06-19 Gustavo Terra Bastos , Angelynn Alvarez , Zachary Flores , Adriana Salerno
‹ Prev 1 4 5 6 7 8 10 Next ›