English
Related papers

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

200 papers

In testing the independence of two Gaussian populations, one computes the distribution of the sample canonical correlation coefficients, given that the actual correlation is zero. The "Laplace transform" of this distribution is not only an…

Combinatorics · Mathematics 2007-05-23 M. Adler , P. van Moerbeke

There is a local ring $E$ of order $4,$ without identity for the multiplication, defined by generators and relations as $E=\langle a,b \mid 2a=2b=0,\, a^2=a,\, b^2=b,\,ab=a,\, ba=b\rangle.$ We study a special construction of self-orthogonal…

Information Theory · Computer Science 2021-06-15 Minjia Shi , Shukai Wang , Jon-Lark Kim , Patrick Solé

In this paper we discourse basises of representable algebras. This question lead to arithmetic problems. We prove algorithmical solvability of exponential-Diophantine equations in rings represented by matrices over fields of positive…

Rings and Algebras · Mathematics 2020-05-12 A. A. Chilikov , A. Ya. Belov

In this work, we define three composite matrices derived from group rings. We employ these composite matrices to create generator matrices of the form [In | {\Omega}(v)], where In is the identity matrix and {\Omega}(v) is a composite matrix…

Information Theory · Computer Science 2021-02-02 Adrian Korban , Serap Sahinkaya , Deniz Ustun

Fix positive integers $p,q,$ and $r$ so that $p$ is prime, $q=p^r$, and $q\equiv 1$ (mod $4$). Fix a graph $G$ as follows: If $r$ is odd or $p\not\equiv 3$ (mod $4$), let $G$ be the $q$-vertex Paley graph; if $r$ is even and $p\equiv 3$…

Combinatorics · Mathematics 2015-10-19 James Alexander

In this paper, we investigate the algebraic structure for polycyclic codes over a specific class of serial rings, defined as $\mathscr R=R[x_1,\ldots, x_s]/\langle t_1(x_1),\ldots, t_s(x_s) \rangle$, where $R$ is a chain ring and each…

Information Theory · Computer Science 2025-03-06 Maryam Bajalan , Edgar Martinez-Moro

Two linear recurrences exhibit mirror symmetry connecting the constants $e$ and $\pi$. When parametrized, their asymptotic connection constants extend to meromorphic functions satisfying additive functional equations with rational…

Number Theory · Mathematics 2026-01-09 Benoit Cloitre

The invariant theory of finite groups can connect the coding theory to the number theory. In this paper, under this conformity, we obtain the minimal generators of the rings of E-polynomials constructed from the groups related to…

Number Theory · Mathematics 2019-09-11 Nur Hamid

Addition chains are a classical construction for fast exponentiation and related computation problems. In this paper, we study a chain for a fixed integer $n$ by decomposing each generator into a \emph{determiner} and a \emph{regulator}…

Number Theory · Mathematics 2026-04-23 Theophilus Agama

The ring of dual numbers over a ring $R$ is $R[\alpha] = R[x]/(x^2)$, where $\alpha$ denotes $x+(x^2)$. For any finite commutative ring $R$, we characterize null polynomials and permutation polynomials on $R[\alpha]$ in terms of the…

Commutative Algebra · Mathematics 2021-10-07 H. Al-Ezeh , A. A. Al-Maktry , S. Frisch

Given $\texttt{S}|\texttt{R}$ a finite Galois extension of finite chain rings and $\mathcal{B}$ an $\texttt{S}$-linear code we define two Galois operators, the closure operator and the interior operator. We proof that a linear code is…

Information Theory · Computer Science 2016-02-22 A. Fotue Tabue , E. Martínez-Moro , C. Mouaha

Given an integer $n$, we introduce the integral Lie ring of partitions with bounded maximal part, whose elements are in one-to-one correspondence to integer partitions with parts in $\{1,2,\dots, n-1\}$. Starting from an abelian subring, we…

Combinatorics · Mathematics 2023-03-10 Riccardo Aragona , Roberto Civino , Norberto Gavioli

We consider linear codes over a field in which the error values are restricted to a subgroup of its unit group. This scenario captures Lee distance codes as well as codes over the Gaussian or Eisenstein integers. Codes correcting restricted…

Information Theory · Computer Science 2026-01-21 Jens Zumbrägel

We establish a novel connection between the central binomial coefficients $\binom{2n}{n}$ and Gould's sequence through the construction of a specialized multivariate polynomial quotient ring. Our ring structure is characterized by ideals…

General Mathematics · Mathematics 2024-05-22 Joseph M. Shunia

In \cite{anote}, Wu and Shi studied $ l $-Galois LCD codes over finite chain ring $\mathcal{R}=\mathbb{F}_q+u\mathbb{F}_q$, where $u^2=0$ and $ q=p^e$ for some prime $p$ and positive integer $e$. In this work, we extend the results to the…

Information Theory · Computer Science 2022-06-20 Astha Agrawal , Gyanendra K. Verma , R. K. Sharma

Let $p$ be an odd prime number, $\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$ and $s$ a positive integer. Using some combinatorial identities, we obtain certain properties for Kronecker product of matrices over $\mathbb{F}_p$…

Information Theory · Computer Science 2019-07-17 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Somphong Jitman

Codes arising from algebraic structures over number fields lead naturally to determinant optimization problems governed by arithmetic invariants. In this paper, we investigate $2\times 2$ space-time block codes defined over rings of…

In this paper, we consider the unit graph $G(\mathbb{Z}_{n})$, where $n=p_{1}^{n_{1}} \text{ or } p_{1}^{n_{1}}p_{2}^{n_{2}} \text{ or } p_{1}^{n_{1}}p_{2}^{n_{2}}p_{3}^{n_{3}}$ and $p_{1}, p_{2}, p_{3}$ are distinct primes. For any prime…

Rings and Algebras · Mathematics 2024-09-01 Rupali S. Jain , B. Surendranath Reddy , Wajid M. Shaikh

A ring R is called an E-ring if the canonical homomorphism from R to the endomorphism ring End(R_Z) of the additive group R_Z, taking any r in R to the endomorphism left multiplication by r turns out to be an isomorphism of rings. In this…

Logic · Mathematics 2007-05-23 Rüdiger Göbel , Saharon Shelah , Lutz Strüngmann

The Galois ring GR$(4^\Delta)$ is the residue ring $Z_4[x]/(h(x))$, where $h(x)$ is a basic primitive polynomial of degree $\Delta$ over $Z_4$. For any odd $\Delta$ larger than $1$, we construct a partition of GR$(4^\Delta) \backslash…

Combinatorics · Mathematics 2023-08-23 Minjia Shi , Xiaoxiao Li , Denis S. Krotov , Ferruh Özbudak
‹ Prev 1 3 4 5 6 7 10 Next ›