English
Related papers

Related papers: Polycyclic codes over serial rings and their annih…

200 papers

This paper present the construction cyclic isodual codes over finite fields and finite chain rings. These codes are monomially equivalent to their dual. Conditions are given for the existence of cyclic isodual codes. In addition, the…

Information Theory · Computer Science 2016-08-16 Aicha Batoul , Kenza Guenda , T. Aaron Gulliver , Nuh Aydin

Let $f(u)$ be a polynomial of degree $m, m \geq 2,$ which splits into distinct linear factors over a finite field $\mathbb{F}_{q}$. Let $\mathcal{R}=\mathbb{F}_{q}[u]/\langle f(u)\rangle$ be a finite non-chain ring. In an earlier paper, we…

Information Theory · Computer Science 2018-05-25 Mokshi Goyal , Madhu Raka

In this paper a framework to study the dual of skew cyclic codes is proposed. The transposed Hamming ring extensions are based in the existence of an anti-isomorphism of algebras between skew polynomial rings. Our construction is applied to…

Information Theory · Computer Science 2018-03-02 José Gómez-Torrecillas , F. J. Lobillo , Gabriel Navarro

Let $R=\mathbb{Z}_q+u\mathbb{Z}_q$, where $q=p^s$ and $u^2=0$. In this paper, some structural properties of cyclic codes over the ring $R$ are considered. A necessary and sufficient condition for cyclic codes over the ring $R$ to be free is…

Information Theory · Computer Science 2015-04-28 Jian Gao , Fang-Wei Fu , Ling Xiao , Rama Krishna Bandi

The ring in the title is the first non commutative ring to have been used as alphabet for block codes. The original motivation was the construction of some quaternionic modular lattices from codes. The new application is the construction of…

Information Theory · Computer Science 2012-02-01 Adel Alahmadi , Patrick Solé , Houda Sboui , Olfa Yemen

Reed-Solomon (RS) codes are constructed over a finite field that have been widely employed in storage and communication systems. Many fast encoding/decoding algorithms such as fast Fourier transform (FFT) and modular approach are designed…

Information Theory · Computer Science 2024-05-03 Wenhao Liu , Zhengyi Jiang , Zhongyi Huang , Linqi Song , Hanxu Hou

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

In this paper we initiate the study of cyclic algebraic geometry codes. We give conditions to construct cyclic algebraic geometry codes in the context of algebraic function fields over a finite field by using their group of automorphisms.…

Algebraic Geometry · Mathematics 2021-06-17 Gustavo Cabaña , María Chara , Ricardo A. Podestá , Ricardo Toledano

We study complementary information set codes of length $tn$ and dimension $n$ of order $t$ called ($t-$CIS code for short). Quasi-cyclic and quasi-twisted $t$-CIS codes are enumerated by using their concatenated structure. Asymptotic…

Information Theory · Computer Science 2017-03-10 Adel Alahmadi , Cem Güneri , Hatoon Shoaib , Patrick Solé

In this paper, we introduce $\mathbb{Z}_{p^r}\mathbb{Z}_{p^r}\mathbb{Z}_{p^s}$-additive cyclic codes for $r\leq s$. These codes can be identified as $\mathbb{Z}_{p^s}[x]$-submodules of $\mathbb{Z}_{p^r}[x]/\langle x^{\alpha}-1\rangle \times…

Information Theory · Computer Science 2022-02-24 Cristina Fernández-Córdoba , Sachin Pathak , Ashish Kumar Upadhyay

Let $q$ be a prime power and let $\mathcal{R}=\mathbb{F}_{q}[u_1,u_2, \cdots, u_k]/\langle f_i(u_i),u_iu_j-u_ju_i\rangle$ be a finite non-chain ring, where $f_i(u_i), 1\leq i \leq k$ are polynomials, not all linear, which split into…

Information Theory · Computer Science 2022-12-07 Swati Bhardwaj , Mokshi Goyal , Madhu Raka

Toric codes are obtained by evaluating rational functions of a nonsingular toric variety at the algebraic torus. One can extend toric codes to the so called generalized toric codes. This extension consists on evaluating elements of an…

Information Theory · Computer Science 2010-02-25 Diego Ruano

Let $R$ be a commutative local finite ring. In this paper, we construct the complete set of pairwise orthogonal primitive idempotents of $R[X]/<g>$ where $g$ is a regular polynomial in $R[X]$. We use this set to decompose the ring…

Information Theory · Computer Science 2019-08-21 Mohammed Elhassani Charkani , Joël Kabore

In this article, we study skew cyclic codes over ring $R=\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2}\mathbb{F}_{q}$, where $q=p^{m}$, $p$ is an odd prime and $v^{3}=v$. We describe generator polynomials of skew cyclic codes over this ring and…

Information Theory · Computer Science 2017-01-05 Minjia Shi , Ting Yao , Adel Alahmadi , Patrick Solé

We study one generator quasi-cyclic codes and four-circulant codes, which are also quasi-cyclic but have two generators. We state the hull dimensions for both classes of codes in terms of the polynomials in their generating elements. We…

Information Theory · Computer Science 2024-01-09 Zohreh Aliabadi , Cem Güneri , Tekgül Kalaycı

This paper investigates the algebraic structure of additive complementary pairs of cyclic codes over a finite commutative ring. We demonstrate that for every additive complementary pair of additive cyclic codes, both constituent codes are…

Information Theory · Computer Science 2025-06-13 Sanjit Bhowmick , Kuntal Deka , Alexandre Fotue Tabue , Edgar Martínez-Moro

In this paper, we give an important isomorphism between contacyclic codes and cyclic codes over finite principal ideal rings. Necessary and sufficient conditions for the existence of non-trivial cyclic self-dual codes over finite principal…

Information Theory · Computer Science 2015-05-06 Aicha Batoul , Kenza Guenda , T. Aaron Gulliver

It is recently conjectured in quantum information processing that phase-shift errors occur with high probability than qubit-flip errors, hence the former is more disturbing to quantum information than the later one. This leads us to…

Information Theory · Computer Science 2009-11-30 Salah A. Aly

In this paper, cyclic codes are established over some finite quaternion integer rings with respect to the quaternion Mannheim distance, and de- coding algorithm for these codes is given.

Information Theory · Computer Science 2010-03-24 Murat Guzeltepe , Mehmet Ozen

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