English
Related papers

Related papers: Duality Preserving Gray Maps for Codes over Rings

200 papers

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

In this paper, we introduce a new definitions of the Gray weight and the Gray map for linear codes over $\mathbb{Z}_9+u\mathbb{Z}_9$ with $u^2=u$. Some results on self-dual codes over this ring are investigated. Further, the structural…

Information Theory · Computer Science 2015-01-05 Jian Gao , XianFang Wang , Fang-Wei Fu

The structure of multivariate semisimple codes over a finite chain ring $R$ is established using the structure of the residue field $\bar R$. Multivariate codes extend in a natural way the univariate cyclic and negacyclic codes and include…

Combinatorics · Mathematics 2007-05-23 E. Martinez-Moro , I. F. Rua

Using linear functional-based duality of modules, we generalize the syndrome decoding algorithm of linear codes over finite fields to those over finite commutative rings. Moreover, If the ring is local the algorithm is simplified by…

Information Theory · Computer Science 2014-10-14 Asmae Drhima , Mustapha Najmeddine

We present some basic theory on the duality of codes over two non-unital rings of order $6$, namely $H_{23}$ and $H_{32}$. For a code $\mathcal{C}$ over these rings, we associate a binary code $\mathcal{C}_a$ and a ternary code…

Information Theory · Computer Science 2025-02-26 Altaf Alshuhail , Rowena Alma Betty , Lucky Galvez

This paper investigates the existence, enumeration and asymptotic performance of self-dual and LCD double circulant codes over Galois rings of characteristic $p^2$ and order $p^4$ with $p$ and odd prime. When $p \equiv 3 \pmod{4},$ we give…

Information Theory · Computer Science 2018-01-23 Minjia Shi , Daitao Huang , Lin Sok , Patrick Solé

We give a description of the duals of linearized Reed-Solomon codes in terms of codes obtained by taking residues of Ore rational functions. Our construction shows in particular that, under some assumptions on the base field, the class of…

Information Theory · Computer Science 2021-10-26 Xavier Caruso , Amaury Durand

In this work, extension theorems are generalized to self-dual codes over rings and as applications many new binary self-dual extremal codes are found from self-dual codes over F_2^m+uF_2^m for m = 1, 2. The duality and distance preserving…

Information Theory · Computer Science 2016-11-26 Abidin Kaya , Bahattin Yildiz

In this paper, we mainly study the theory of linear codes over the ring $R =\mathbb{Z}_4+u\mathbb{Z}_4+v\mathbb{Z}_4+uv\mathbb{Z}_4$. By the Chinese Remainder Theorem, we have $R$ is isomorphic to the direct sum of four rings…

Information Theory · Computer Science 2016-01-19 Ping Li , Xuemei Guo , Shixin Zhu

In this work, quadratic reside codes over the ring F2 +uF2 +u^2F2 with u^3 = u are considered. A duality and distance preserving Gray map from F2 + uF2 + u^2F2 to (F_2)^3 is defined. By using quadratic double circulant, quadratic bordered…

Information Theory · Computer Science 2016-02-25 Abidin Kaya , Bahattin Yildiz , Irfan Siap

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

In this paper, we give conditions for the existence of Hermitian self-dual $\Theta-$cyclic and $\Theta-$negacyclic codes over the finite chain ring $\mathbb{F}_q+u\mathbb{F}_q$. By defining a Gray map from $R=\mathbb{F}_q+u\mathbb{F}_q$ to…

Information Theory · Computer Science 2019-03-20 Zineb Hebbache , Kenza Guenda , N. Tugba Özzaim , Mehmet Özen , T. Aaron Gulliver

Self-dual codes over $\Z_2\times\Z_4$ are subgroups of $\Z_2^\alpha \times\Z_4^\beta$ that are equal to their orthogonal under an inner-product that relates to the binary Hamming scheme. Three types of self-dual codes are defined. For each…

Information Theory · Computer Science 2009-10-19 J. Borges , S. T. Dougherty , C. Fernandez-Cordoba

In this paper, we study the linear codes over the commutative ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$ and their Gray images, where $v^{3}=v$. We define the Lee weight of the elements of $R$, we give a Gray map from $R^{n}$ to $\F^{3n}_{q}$ and…

Information Theory · Computer Science 2015-05-01 A. Melakheso , K. Guenda

In this work, we study codes over the ring R_{k,m}=F_2[u,v]/<u^{k},v^{m},uv-vu>, which is a family of Frobenius, characteristic 2 extensions of the binary field. We introduce a distance and duality preserving Gray map from R_{k,m} to…

Information Theory · Computer Science 2014-06-06 Nesibe Tufekci , Bahattin Yildiz

In this paper, we study self-dual codes over $\mathbb{Z}_2 \times (\mathbb{Z}_2+u\mathbb{Z}_2) $, where $u^2=0$. Three types of self-dual codes are defined. For each type, the possible values $\alpha,\beta$ such that there exists a code…

Information Theory · Computer Science 2016-10-05 Long Yu , Qiong Huang , Hongwei Liu , Xiusheng Liu

In this paper quadratic residue codes over the ring Fp + vFp are introduced in terms of their idempotent generators. The structure of these codes is studied and it is observed that these codes share similar properties with quadratic residue…

Information Theory · Computer Science 2016-02-25 Abidin Kaya , Bahattin Yildiz , İrfan Siap

We give several related versions of global Grothendieck Duality for unbounded complexes on noetherian formal schemes. The proofs, based on a non-trivial adaptation of Deligne's method for the special case of ordinary schemes, are reasonably…

alg-geom · Mathematics 2008-02-03 Leovigildo Alonso , Ana Jeremias , Joseph Lipman

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

We study the structure of linear codes over the ring $B_k$ which is defined by $\mathbb{F}_{p^r}[v_1,v_2,\ldots,v_k]/\langle v_i^2=v_i,~v_iv_j=v_jv_i \rangle_{i,j=1}^k.$ In order to study the codes, we begin with studying the structure of…

Information Theory · Computer Science 2018-01-18 Irwansyah , Djoko Suprijanto
‹ Prev 1 2 3 10 Next ›