Related papers: Linear Network Coding over Rings, Part I: Scalar C…

Let $\mathcal{R}=\mathbb{F}_{p^m}[u]/\langle u^3 \rangle $ be the finite commutative chain ring with unity, where $p$ is a prime, $m$ is a positive integer and $\mathbb{F}_{p^m}$ is the finite field with $p^m$ elements. In this paper, we…

A cover of a unital, associative (not necessarily commutative) ring $R$ is a collection of proper subrings of $R$ whose set-theoretic union equals $R$. If such a cover exists, then the covering number $\sigma(R)$ of $R$ is the cardinality…

In this paper we prove that the subalgebras of cocommutative elements in the quantized coordinate rings of $M_{n}$, $GL_{n}$ and $SL_{n}$ are the centralizers of the trace $x_{1,1}+\dots+x_{n,n}$ in each algebra, for…

The strong global dimension of a ring is the supremum of the length of perfect complexes that are indecomposable in the derived category. In this note we characterize the noetherian commutative rings that have finite strong global…

In this article, we study skew constacyclic codes over a class of finite commutative semisimple rings. The automorphism group of $\mathcal{R}=\prod_{i=1}^t F_q$ is determined, and we characterize skew constacyclic codes over ring by linear…

Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random linear network coding. What the maximal cardinality of any constant-dimension code with finite dimension and minimum…

In this paper, we introduce and study two new classes of commutative rings, namely semi transitional rings and transitional rings, which extend several classical ideas arising from rings of continuous functions and their variants. A general…

Let R be a commutative ring with1 and R[X] be the polynomial ring over R. We determine the underlying ring R over which the polynomial ring R[X] has the property that all its prime ideals are set theoretic complete intersections.

A quasi-order is a binary, reflexive and transitive relation. In the Journal of Pure and Applied Algebra 45 (1987), S.M. Fakhruddin introduced the notion of (totally) quasi-ordered fields and showed that each such field is either an ordered…

Let D be a division algebra with center F. A maximal subfield of D is defined to be a field K such that CD(K) = K; that is, K is its own centralizer in D. A maximal subfield K is said to be self-invariant if it normalises by itself, i.e.…

In this paper, we describe linear and cyclic codes over the rings of the form $R_{s,p}=\mathbb{Z}_{p}[u]/\left( f\left(u\right) /\left( u-s\right) \right)$, where $p$ is a prime number and $f\left( u\right) =u^{p}-u$, with $s\in…

Additive cyclic codes over Galois rings were investigated in previous works. In this paper, we investigate the same problem but over a more general ring family, finite commutative chain rings. When we focus on non-Galois finite commutative…

Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…

We study notions of generic and coarse computability in the context of computable structure theory. Our notions are stratified by the $\Sigma_\beta$ hierarchy. We focus on linear orderings. We show that at the $\Sigma_1$ level all linear…

Let R0 be a commutative associative ring (not necessarily unital), G a group and alpha a partial action by ideals that contain local units. We show that R0 is maximal commutative in the partial skew group ring R0*G if and only if R0 has the…

The problem of linking the structure of a finite linear dynamical system with its dynamics is well understood when the phase space is a vector space over a finite field. The cycle structure of such a system can be described by the…

In this paper, we continue the study of Maximally Recoverable (MR) Grid Codes initiated by Gopalan et al. [SODA 2017]. More precisely, we study codes over an $m \times n$ grid topology with one parity check per row and column of the grid…

We examine the issue of separation and code design for networks that operate over finite fields. We demonstrate that source-channel (or source-network) separation holds for several canonical network examples like the noisy multiple access…

Let $R$ be a commutative ring with unity. The co-maximal ideal graph of $R$, denoted by $\Gamma(R)$, is a graph whose vertices are the proper ideals of $R$ which are not contained in the Jacobson radical of $R$, and two vertices $I_1$ and…

Let $R$ be a finite commutative ring with unity $1_R$ and $k \in R$. Properties of one-sided $k$-orthogonal $n \times n$ matrices over $R$ are presented. When $k$ is idempotent, these matrices form a semigroup structure. Consequently new…