相关论文: On Eisenstein additive codes over chain rings and …

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

Let $A$ be the ring of integers of global field $K$. Let $G \subseteq GL_2(A)$ be a finite group. Let $G$ act linearly on $R = A[X,Y]$ (fixing $A$). Let $R^G$ be the ring of invariants. In the equi-characteristic case we prove $R^G$ is…

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…

A convolutional code $\C$ over $\ZZ[D]$ is a $\ZZ[D]$-submodule of $\ZZN[D]$ where $\ZZ[D]$ stands for the ring of polynomials with coefficients in $\ZZ$. In this paper, we study the list decoding problem of these codes when the…

Repeated root Cyclic and Negacyclic codes over Galois rings have been studied much less than their simple root counterparts. This situation is beginning to change. For example, repeated root codes of length $p^s$, where $p$ is the…

We generalize the usual relationship between irreducible Zariski closed subsets of the affine space, their defining ideals, coordinate rings, and function fields, to a non-commutative setting, where "varieties" carry a PGL_n-action, regular…

let $R$ be a regular local ring of a mixed characteristic $(0,p)$ where $p\neq 2$ is a prime number. Suppose that the quotient ring $R/pR$ is also regular. Fix a non-degenerate Pfister form $Q(T_{1},\ldots,T_{2^{m}})$ over $R$ and an…

Goppa codes are particularly appealing for cryptographic applications. Every improvement of our knowledge of Goppa codes is of particular interest. In this paper, we present a sufficient and necessary condition for an irreducible monic…

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…

We study a unitary analog to Redheffer's matrix. It is first proved that the determinant of this matrix is the unitary analogue to that of Redheffer's matrix. We also show that the coefficients of the characteristic polynomial may be…

C.M. Bender and G. V. Dunne showed that linear combinations of words $q^{k}p^{n}q^{n-k}$, where $p$ and $q$ are subject to the relation $qp - pq = \imath$, may be expressed as a polynomial in the symbol $z = \tfrac{1}{2}(qp+pq)$. Relations…

Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right…

This article explores additive codes with one-rank hull, offering key insights and constructions. The article introduces a novel approach to finding one-rank hull codes over finite fields by establishing a connection between self-orthogonal…

Using a complex parameterizing rational spherical chains, we construct explicit cocycles for $\mathrm{GL}_n(\Q)$ valued in the motivic cohomology of (open subsets of) the algebraic $n$-torus $\mathbb{G}_m^n$. The resulting cocycles directly…

Additive codes have attracted considerable attention for their potential to outperform linear codes. However, distinguishing strictly additive codes from those that are equivalent to linear codes remains a fundamental challenge. To resolve…

We introduce two constructions of additive codes over finite fields. Both constructions start with a linear code over a field with $q$ elements and give additive codes over the field with $q^h$ elements whose minimum distance is…

In this work, we investigate additive complementary dual (ACD) codes and their construction over finite fields $\mathbb{F}_{q^2}$ with respect to the trace inner products, where $q$ is a prime power. First, we associate an additive code…

For a finite group $G$ and positive integer $g$, a $g$-additive basis is a subset of $G$ whose pairwise sums cover each element of $G$ at least $g$ times, with $g$-difference bases defined similarly using pairwise differences. While prior…

A graph is an instrument which is extensively utilized to model various problems in different fields. Up to date, many graphs have been developed to represent algebraic structures, particularly rings in order to study their properties. In…

A novel implementation of a special class of Galois ring, in which the multiplication can be realized by a cyclic convolution, is applied to the construction of network codes. The primitive operations involved are byte-wise shifts and…