English
Related papers

Related papers: Quaternions over Galois rings and their codes

200 papers

A systematic way of constructing Grassmannian codes endowed with the subspace distance as lifts of matrix codes over the prime field $GF(p)$ is introduced. The matrix codes are $GF(p)$-subspaces of the ring $M_2(GF(p))$ of $2 \times 2$…

Information Theory · Computer Science 2015-02-23 Bryan Hernandez , Virgilio Sison

In the recent work \cite{shi18}, a combinatorial problem concerning linear codes over a finite field $\F_q$ was introduced. In that work the authors studied the weight set of an $[n,k]_q$ linear code, that is the set of non-zero distinct…

Information Theory · Computer Science 2022-07-18 Tim L. Alderson , Alessandro Neri

Let $q=p^s$ be a prime power, $F$ a field containing a root of unity of order $q$, and $G_F$ its absolute Galois group. We determine a new canonical quotient $\mathrm{Gal}(F_{(3)}/F)$ of $G_F$ which encodes the full mod-$q$ cohomology ring…

Number Theory · Mathematics 2015-04-21 Ido Efrat , Jan Minac

For each pair of matrices $A$ and $B$ with the same order, let $\|A-B\|_F$ denote their Frobenius distance. This paper deals mainly with the Frobenius distances from projections to an idempotent matrix. For every idempotent $Q\in…

Functional Analysis · Mathematics 2024-04-25 Xiaoyi Tian , Qingxiang Xu , Chunhong Fu

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

We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property,…

Number Theory · Mathematics 2012-09-11 Rafe Jones

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

Recently, linear codes with a few weights were widely investigated due to their applications in secret sharing schemes and authentication schemes. In this letter, we present a class of $q$-ary linear codes derived from irreducible cyclic…

Information Theory · Computer Science 2016-04-18 Ziling Heng , Qin Yue

With a small suitable modification, dropping the projectivity condition, we extend the notion of a Frobenius algebra to grant that a Frobenius algebra over a Frobenius commutative ring is itself a Frobenius ring. The modification introduced…

Rings and Algebras · Mathematics 2019-07-18 José Gómez-Torrecillas , Erik Hieta-aho , F. J. Lobillo , Sergio López-Permouth , Gabriel Navarro

Let $p$ be a prime such that $p \equiv 2$ or $3$ mod $5$. Linear block codes over the non-commutative matrix ring of $2 \times 2$ matrices over the prime field $GF(p)$ endowed with the Bachoc weight are derived as isometric images of linear…

Information Theory · Computer Science 2015-02-17 Bryan Hernandez , Virgilio Sison

Let $A_q(n,d)$ be the maximum order (maximum number of codewords) of a $q$-ary code of length $n$ and Hamming distance at least $d$. And let $A(n,d,w)$ that of a binary code of constant weight $w$. Building on results from algebraic graph…

Information Theory · Computer Science 2008-07-01 Salim Y. El Rouayheb , C. N. Georghiades , E. Soljanin , A. Sprintson

In this paper, several classes of three-weight codes and two-weight codes for the homogeneous metric over the chain ring $R=\mathbb{F}_p+u\mathbb{F}_p+\cdots +u^{k-1}\mathbb{F}_{p},$ with $u^k=0,$ are constructed, which generalises…

Information Theory · Computer Science 2017-03-21 Minjia Shi , Rongsheng Wu , Liqin Qian , Lin Sok , Patrick Solé

In this paper, several classes of three-weight codes and two-weight codes for the homogeneous metric over the chain ring $R=\mathbb{F}_p+u\mathbb{F}_p+\cdots +u^{k-1}\mathbb{F}_{p},$ with $u^k=0,$ are constructed, which generalises…

Information Theory · Computer Science 2017-01-10 Minjia Shi , Rongsheng Wu , Liqin Qian , Lin Sok , Patrick Sole

In this study, linear codes having their Lee-weight distributions over the semi-local ring $\mathbb{F}_{q}+u\mathbb{F}_{q}$ with $u^{2}=1$ are constructed using the defining set and Gauss sums for an odd prime $q $. Moreover, we derive…

Information Theory · Computer Science 2024-07-08 Pavan Kumar , Noor Mohammad Khan

For any positive integer $m$ and an odd prime $p$; let $\mathbb{F}_{q}+u\mathbb{F}_{q}$, where $q=p^{m}$, be a ring extension of the ring $\mathbb{F}_{p}+u\mathbb{F}_{p}.$ In this paper, we construct linear codes over…

Information Theory · Computer Science 2024-06-27 Pavan Kumar , Noor Mohammad Khan

We define weighted projective Reed-Muller codes over a subset of weighted projective space over a finite field. We focus on the case when the set X is a projective weighted torus. We show that the vanishing ideal of X is a lattice ideal and…

Commutative Algebra · Mathematics 2013-07-25 Eduardo Dias , Jorge Neves

We study origami $f: C \rightarrow E$ with $G$-Galois cover $Q_8$. For a point $P \in E(\mathbb{Q}) \backslash \left\{ \mathcal{O} \right\}$, we study the field obtained by adjoining to $\mathbb{Q}$ the coordinates of all of the preimages…

Number Theory · Mathematics 2018-05-11 Rachel Davis , Edray Herber Goins

In this paper, we extend a necessary and sufficient condition for a linear code over a Galois ring to be minimal and establish new bounds on the length of an $m$-dimensional minimal linear code. Building upon this structural…

Information Theory · Computer Science 2026-03-30 Biplab Chatterjee , Sihem Mesnager , Ratnesh Kumar Mishra , Makhan Maji , Kalyan Hansda

The Galois ring $GR(p^r,m)$ of characteristic $p^r$ and cardinality $p^{rm}$, where $p$ is a prime and $r,m \ge 1$ are integers, is a Galois extension of the residue class ring $Z_{p^r}$ by a root $\omega$ of a monic basic irreducible…

Information Theory · Computer Science 2014-10-02 Virgilio Sison

For each odd prime power $q$, let $4 \leq n\leq q^{2}+1$. Hermitian self-orthogonal $[n,2,n-1]$ codes over $GF(q^{2})$ with dual distance three are constructed by using finite field theory. Hence, $[[n,n-4,3]]_{q}$ quantum MDS codes for $4…

Information Theory · Computer Science 2015-05-13 Ruihu Li , Zongben Xu