English
Related papers

Related papers: On Eisenstein additive codes over chain rings and …

200 papers

Fixed-size commutative rings are quasi-ordered such that all scalar linearly solvable networks over any given ring are also scalar linearly solvable over any higher-ordered ring. As consequences, if a network has a scalar linear solution…

Information Theory · Computer Science 2018-01-31 Joseph Connelly , Kenneth Zeger

In this paper we investigate codes over finite commutative rings R, whose generator matrices are built from \$\alpha\$-circulant matrices. For a non-trivial ideal I<R we give a method to lift such codes over R/I to codes over R, such that…

Combinatorics · Mathematics 2015-03-11 Michael Kiermaier , Alfred Wassermann

Let $n; r; e; s$ be are positive integers and the prime p; the finite local principal ideals ring of parameters $p; n; r; e; s)$ $GR(p^n;r)[x]/(x^e - pu ; x^s),$ is defined by an invertible element u of the Galois ring $GR(p^n; r)$ of…

Rings and Algebras · Mathematics 2015-02-09 Alexandre Fotue Tabue , Christophe Mouaha

We present an algebraic structure in modules over integer rings with cardinality prime powers, which allows to define bases. With such structure, we prove a similar version for the basis extension theorem of linear algebra over fields.…

Rings and Algebras · Mathematics 2017-09-14 Ady Cambraia , Allan O. Moura , Anderson T. Silva

Let $N$ and $p$ be prime numbers with $p \geq 5$ such that $p || (N + 1)$. In a previous paper, we showed that there is a cuspform $f$ of weight 2 and level $\Gamma_0(N^2)$ whose $\ell$-th Fourier coefficient is congruent to $\ell + 1$…

Number Theory · Mathematics 2025-01-09 Jaclyn Lang , Preston Wake

The Artin-Schreier polynomial $Z^p - Z - a$ is very well known. Polynomials of this type describe all degree $p$ (cyclic) Galois extensions over any commutative ring of characteristic $p$. Equally attractive is the associated Galois action.…

Rings and Algebras · Mathematics 2022-12-08 David J. Saltman

Additive codes may have better parameters than linear codes. However, still very few cases are known and the explicit construction of such codes is a challenging problem. Here we show that a Griesmer type bound for the length of additive…

Information Theory · Computer Science 2026-05-11 Sascha Kurz

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

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 first introduce the notion of generalized pair weights of an $[n, k]$-linear code over the finite field $\mathbb{F}_q$ and the notion of pair $r$-equiweight codes, where $1\le r\le k-1$. Some basic properties of…

Information Theory · Computer Science 2020-09-16 Hongwei Liu , Xu Pan

Quasi-polycyclic (QP for short) codes over a finite chain ring $R$ are a generalization of quasi-cyclic codes, and these codes can be viewed as an $R[x]$-submodule of $\mathcal{R}_m^{\ell}$, where $\mathcal{R}_m:= R[x]/\langle f\rangle$,…

Information Theory · Computer Science 2021-11-10 Rongsheng Wu , Minjia Shi , Patrick Solé

For any constacyclic code over a finite commutative chain ring of length coprime to the characteristic of the ring, we construct explicitly generator polynomials and check polynomials, and exhibit a BCH bound for such constacyclic codes. As…

Information Theory · Computer Science 2021-05-21 Yun Fan

In this note, we give a criteria whether given two Eisenstein polynomials over a padic field define the same extension (Proposition 1.6). In particular, we completely identify Eisenstein polynomials of degree p (Theorem 1.16). This note is…

Number Theory · Mathematics 2013-02-06 Shun'ichi Yokoyama , Manabu Yoshida

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

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é

Linear codes are considered over the ring $\mathbb{Z}_4+v\mathbb{Z}_4$, where $v^2=v$. Gray weight, Gray maps for linear codes are defined and MacWilliams identity for the Gray weight enumerator is given. Self-dual codes, construction of…

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

This paper investigates the Terwilliger algebra of some group association schemes related to codes. In addition, it also shows the generators of invariant rings appearing by E-polynomials.

Number Theory · Mathematics 2022-02-02 Nur Hamid

An isomorphism between the group ring of a finite group and a ring of certain block diagonal matrices is established. The group ring $RG$ of a finite group $G$ is isomorphic to the set of {\em group ring matrices} over $R$. It is shown that…

Representation Theory · Mathematics 2015-06-18 Ted Hurley

Given a prime power $q$ and a positive integer $r>1$ we say that a cyclic code of length $n$, $C\subseteq F_{q^r}^n$, is Galois supplemented if for any non-trivial element $\sigma$ in the Galois group of the extension $ F_{q^r}/ F_q$,…

Information Theory · Computer Science 2019-03-11 Josu Sangroniz , Luis Martínez

When does a Noetherian commutative ring $R$ have uniform symbolic topologies on primes--read, when does there exist an integer $D>0$ such that the symbolic power $P^{(Dr)} \subseteq P^r$ for all prime ideals $P \subseteq R$ and all $r >0$?…

Commutative Algebra · Mathematics 2018-11-26 Robert M. Walker