English
Related papers

Related papers: $\mathbb{Z}_{q}(\mathbb{Z}_{q}+u\mathbb{Z}_{q})$-L…

200 papers

In this paper, we introduce the homogeneous weight and homogeneous Gray map over the ring $R_{q}=\mathbb{F}_{2}[u_{1},u_{2},\ldots,u_{q}]/\left\langle u_{i}^{2}=0,u_{i}u_{j}=u_{j}u_{i}\right\rangle$ for $q \geq 2$. We also consider the…

Information Theory · Computer Science 2015-06-09 K. Chatouh , K. Guenda , T. A. Gulliver , L. Noui

Let $ \mathbb F_2[u]/ \langle u^k \rangle= \mathbb F_2+u\mathbb F_2+u^2\mathbb F_2+\cdots+u^{k-1}\mathbb F_2 ,$ where $u^k=0$ for a positive integer $k$, and $\mathcal{R}=M_4 (\mathbb F_2( u)/ \langle u^k \rangle)$ be the finite…

Information Theory · Computer Science 2026-02-23 Soham Ravikant Joshi , Shikha Patel , Om Prakash

We describe families of nonassociative finite unital rings that occur as quotients of natural nonassociative orders in generalized nonassociative cyclic division algebras over number fields. These natural orders have already been used to…

Rings and Algebras · Mathematics 2021-04-13 Susanne Pumpluen

In this paper we give the enumeration formulas for Euclidean self-dual skew-cyclic codes over finite fields when $(n,|\theta|)=1$ and for some cases when $(n,|\theta|)>1,$ where $n$ is the length of the code and $|\theta|$ is the order of…

Information Theory · Computer Science 2017-05-18 Irwansyah , Intan Muchtadi-Alamsyah , Ahmad Muchlis , Aleams Barra , Djoko Suprijanto

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

The purpose of this article is to study constacyclic codes of length $np^s$ over $R^t:=\frac{\mathbb{F}_{p^m}[u]}{\langle u^t \rangle },$ where $t$ is a natural number and $\gcd(n,p)=1$. We give generators of all the ideals of…

Information Theory · Computer Science 2026-05-13 Akanksha Tiwari , Pramod Kanwar , Ritumoni Sarma

Constacyclic codes are important classes of linear codes that have been applied to the construction of quantum codes. Six new families of asymmetric quantum codes derived from constacyclic codes are constructed in this paper. Moreover, the…

Information Theory · Computer Science 2014-04-01 Liqi Wang , Shixin Zhu

In this paper, we construct an infinite family of five-weight codes from trace codes over the ring $R=\mathbb{F}_2+u\mathbb{F}_2$, where $u^2=0.$ The trace codes have the algebraic structure of abelian codes. Their Lee weight is computed by…

Information Theory · Computer Science 2018-02-28 Minjia Shi , Liqin Qian , Patrick Sole

In the last 60 years coding theory has been studied a lot over finite fields $\mathbb{F}_q$ or commutative rings $\mathcal{R}$ with unity. Although in $1993$, a study on the classification of the rings (not necessarily commutative or ring…

Information Theory · Computer Science 2022-08-19 Sourav Deb , Isha Kikani , Manish K Gupta

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.…

Information Theory · Computer Science 2015-08-31 Shixin Zhu , Xiaojing Chen

In this paper the relationship between $S$-subgroups in $\Z_{2}^{n}$ and binary codes is shown. If the codes used are both $P(T)$-codes and $G$-codes, then the $S$-subgroup is free. The codes constructed are cyclic, decimated or symmetric…

Combinatorics · Mathematics 2019-06-12 Ronald Orozco López

Based on good algebraic structures and practicabilities, generalized quasi-cyclic (GQC) codes play important role in coding theory. In this paper, we study some results on GQC codes over $\mathbb{Z}_4$ including the normalized generating…

Rings and Algebras · Mathematics 2022-03-24 Jian Gao , Xiangrui Meng , Fang-Wei Fu

Quasi-cyclic (QC) codes form an important generalization of cyclic codes. It is well know that QC codes of length $s\ell$ with index $s$ over the finite field $\mathbb{F}$ are $\mathbb{F}[y]$-submodules of the ring $\frac{\mathbb{F}[x,y]}{<…

Information Theory · Computer Science 2017-05-01 Zahra Sepasdar

We achieve new results on skew polynomial rings and their quotients, including the first explicit example of a skew polynomial ring where the ratio of the degree of a skew polynomial to the degree of its bound is not extremal. These methods…

Combinatorics · Mathematics 2025-02-20 F. J. Lobillo , Paolo Santonastaso , John Sheekey

In this paper, we study the algebraic structure of $(\sigma,\delta)$-polycyclic codes, defined as submodules in the quotient module $S/Sf$, where $S=R[x,\sigma,\delta]$ is the Ore extension ring, $f\in S$, and $R$ is a finite but not…

Information Theory · Computer Science 2024-03-01 Maryam Bajalan , Ivan Landjev , Edgar Martínez-Moro , Steve Szabo

Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder…

Information Theory · Computer Science 2017-02-02 Cem Güneri , Ferruh Özbudak , Buket Özkaya , Elif Saçıkara , Zahra Sepasdar , Patrick Solé

Over a finite field $\mathbb{F}_{q^m}$, the evaluation of skew polynomials is intimately related to the evaluation of linearized polynomials. This connection allows one to relate the concept of polynomial independence defined for skew…

Information Theory · Computer Science 2016-10-26 Siyu Liu , Felice Manganiello , Frank R. Kschischang

In this paper, we mainly study the some structure of cyclic DNA codes of odd length over the ring $R = \F_2[u,v]/\langle u^2-1,v^3-v,uv-vu \rangle$ which play an important role in DNA computing. We established a direct link between the…

Information Theory · Computer Science 2015-11-13 Sukhamoy Pattanayak , Abhay Kumar Singh , Pratyush Kumar

Employing isomorphisms between their ambient rings, we propose new definitions of equivalence and isometry for skew polycyclic codes that will lead to tighter classifications than existing ones. This reduces the number of previously known…

Information Theory · Computer Science 2026-02-24 Susanne Pumpluen

In this paper, we mainly consider quasi-cyclic (QC) codes over finite chain rings. We study module structures and trace representations of QC codes, which lead to some lower bounds on the minimum Hamming distance of QC codes. Moreover, we…

Information Theory · Computer Science 2013-09-09 Jian Gao , Linzhi Shen , Fang-Wei Fu
‹ Prev 1 8 9 10 Next ›