English
Related papers

Related papers: Simplex and MacDonald Codes over $R_{q}$

200 papers

Linear codes over finite rings become one of hot topics in coding theory after Hommons et al.([4], 1994) discovered that several remarkable nonlinear binary codes with some linear-like properties are the images of Gray map of linear codes…

Information Theory · Computer Science 2016-03-08 Aixian Zhang , Jin Li , Keqin Feng

We construct two series of linear codes over finite ring $\mathbb{F}_{q}[x]/(x^2)$ and Galois ring $GR(p^2,m)$ respectively reaching the Griesmer bound. They derive two series of codes over finite field $\mathbb{F}_{q}$ by Gray map. The…

Information Theory · Computer Science 2016-12-06 Jin Li , Aixian Zhang , Keqin Feng

Let $F_p$ be the prime field with $p$ elements. We derive the homogeneous weight on the Frobenius matrix ring $M_2(F_p)$ in terms of the generating character. We also give a generalization of the Lee weight on the finite chain ring…

Information Theory · Computer Science 2017-06-30 Dixie F. Falcunit , Virgilio P. Sison

This article examines group ring codes over finite fields and finite groups. We also present a section on two-dimensional cyclic codes in the quotient ring $\mathbb{F}_q[x, y] / \langle x^{l} - 1, y^{m} - 1 \rangle$. These two-dimensional…

Information Theory · Computer Science 2025-04-22 Kanat Abdukhalikov , Tushar Bag , Daniel Panario

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

Let $R=\mathbb{F}_2+u\mathbb{F}_2+u^2\mathbb{F}_2$ be a non-chain finite commutative ring, where $u^3=u$. In this paper, we mainly study the construction of quantum codes from cyclic codes over $R$. We obtained self-orthogonal codes over…

Information Theory · Computer Science 2016-01-13 Sukhamoy Pattanayak , Abhay Kumar Singh , Pratyush Kumar

Recently, many good quantum codes over various finite fields $F_q$ have been constructed from codes over extension rings or mixed alphabet rings via some version of a Gray map. We show that most of these codes can be obtained more directly…

Information Theory · Computer Science 2024-10-17 Nuh Aydin , Trang T. T. Nguyen , Long B. Tran

Linear codes are considered over the ring Z_4+uZ_4, a non-chain extension of Z_4. Lee weights, Gray maps for these codes are defined and MacWilliams identities for the complete, symmetrized and Lee weight enumerators are proved. Two…

Rings and Algebras · Mathematics 2013-07-12 Bahattin Yildiz , Suat Karadeniz

In this paper, the investigation on the algebraic structure of the ring $\frac{\mathbb{F}_q[v]}{\langle\,v^q-v\,\rangle}$ and the description of its automorphism group, enable to study the algebraic structure of codes and their dual over…

Information Theory · Computer Science 2019-02-28 Joël Kabore , Alexandre Fotue-Tabue , Kenza Guenda , Mohammed E. Charkani

It is shown in this paper that, if $R$ is a Frobenius ring, then the quaternion ring $\mathcal{H}_{a,b}(R)$ is a Frobenius ring for all units $a,b \in R$. In particular, if $q$ is an odd prime power then $\mathcal{H}_{a,b}(\mathbb{F}_q)$ is…

Information Theory · Computer Science 2021-09-07 Pierre Lance Tan , Virgilio Sison

Let $p$ be a prime and $\mathbb{F}_q$ be the finite field of order $q=p^m$. In this paper, we study $\mathbb{F}_q\mathcal{R}$-skew cyclic codes where $\mathcal{R}=\mathbb{F}_q+u\mathbb{F}_q$ with $u^2=u$. To characterize…

Information Theory · Computer Science 2023-05-18 Om Prakash , Shikha Patel , Habibul Islam

Let $\mathbb{F}_{q}$ be a finite field of cardinality $q$, $R=\mathbb{F}_{q}[u]/\langle u^4\rangle=\mathbb{F}_{q}+u\mathbb{F}_{q}+u^2\mathbb{F}_{q}+u^3\mathbb{F}_{q}$ $(u^4=0)$ which is a finite chain ring, and $n$ be a positive integer…

Information Theory · Computer Science 2015-11-10 Yuan Cao , Yonglin Cao , Jian Gao

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

In this paper, we examine the structure of systems that are weighted homogeneous for several systems of weights, and how it impacts the computation of Gr\"obner bases. We present several linear algebra algorithms for computing Gr\"obner…

Symbolic Computation · Computer Science 2024-04-09 Thibaut Verron

In this paper, several infinite families of codes over the extension of non-unital non-commutative rings are constructed utilizing general simplicial complexes. Thanks to the special structure of the defining sets, the principal parameters…

Information Theory · Computer Science 2024-07-16 Yanan Wu , Tingting Pang , Nian Li , Yanbin Pan , Xiangyong Zeng

We give results on the question of code optimality for linear codes over finite Frobenius rings for the homogeneous weight. This article improves on the existing Plotkin bound derived in an earlier paper, and suggests a version of a…

Combinatorics · Mathematics 2009-05-11 Eimear Byrne , Marcus Greferath , Axel Kohnert , Vitaly Skachek

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

Recently, some infinite families of binary minimal and optimal linear codes are constructed from simplicial complexes by Hyun {\em et al}. Inspired by their work, we present two new constructions of codes over the ring $\Bbb F_2+u\Bbb F_2$…

Information Theory · Computer Science 2019-10-11 Yansheng Wu , Xiaomeng Zhu , Qin Yue

Cyclic codes over R have been introduced recently. In this paper, we study the cyclic codes over R and their $\Z_2$ image. Making use of algebraic structure, we find the some good $\Z_2$ codes of length 28.

Information Theory · Computer Science 2015-07-20 Sukhamoy Pattanayak , Abhay Kumar Singh

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