Related papers: Linear Network Coding over Rings, Part I: Scalar C…
For a (single-source) multicast network, the size of a base field is the most known and studied algebraic identity that is involved in characterizing its linear solvability over the base field. In this paper, we design a new class…
In this paper, we give a notation on the Singleton bounds for linear codes over a finite commutative quasi-Frobenius ring in the work of Shiromoto [5]. We show that there exists a class of finite commutative quasi-Frobenius rings. The…
We study scalar-linear and vector-linear solutions of the generalized combination network. We derive new upper and lower bounds on the maximum number of nodes in the middle layer, depending on the network parameters and the alphabet size.…
In this paper we extend the relation between convolutional codes and linear systems over finite fields to certain commutative rings through first order representations . We introduce the definition of rings with representations as those for…
In this paper we describe a class of codes called {\it permutation codes}. This class of codes is a generalization of cyclic codes and quasi-cyclic codes. We also give some examples of optimal permutation codes over binary, ternary, and…
Several problems in algebraic geometry and coding theory over finite rings are modeled by systems of algebraic equations. Among these problems, we have the rank decoding problem, which is used in the construction of public-key cryptography.…
We consider codes defined over an affine algebra $\mathcal A=R[X_1,\dots,X_r]/\left\langle t_1(X_1),\dots,t_r(X_r)\right\rangle$, where $t_i(X_i)$ is a monic univariate polynomial over a finite commutative chain ring $R$. Namely, we study…
Several topologies can be defined on the prime, the maximal and the minimal prime spectra of a commutative ring; among them, we mention the Zariski topology, the patch topology and the flat topology. By using these topologies, Tarizadeh and…
A family of subsets $\mathcal{F} \subseteq \mathcal{P}(\{1, 2, \ldots, n\})$ has the disparate union property if any two disjoint subfamilies $\mathcal{F}_1, \mathcal{F}_2 \subseteq \mathcal{F}$ have distinct unions $\bigcup \mathcal{F}_1…
In this paper, we consider some structures of linear codes over the ring $\mathcal{R}_k=R[v_1,\dots,v_k],$ where $v_i^2=v_i$ forall $i=1,\dots,k),$ and $R$ is a finite commutative Frobenius ring.
The question of embedding fields into central simple algebras $B$ over a number field $K$ was the realm of class field theory. The subject of embedding orders contained in the ring of integers of maximal subfields $L$ of such an algebra…
We consider a network coding setting where some of the messages and edges have fixed alphabet sizes, that do not change when we increase the common alphabet size of the rest of the messages and edges. We prove that the problem of deciding…
This paper considers vector network coding based on rank-metric codes and subspace codes. Our main result is that vector network coding can significantly reduce the required field size compared to scalar linear network coding in the same…
Given a representation of a finite group $G$ over some commutative base ring $\mathbf{k}$, the cofixed space is the largest quotient of the representation on which the group acts trivially. If $G$ acts by $\mathbf{k}$-algebra automorphisms,…
The rank decoding problem has been the subject of much attention in this last decade. This problem, which is at the base of the security of public-key cryptosystems based on rank metric codes, is traditionally studied over finite fields.…
A commutative ring R is said to be coverable if it is the union of its proper subrings and said to be finitely coverable if it is the union of a finite number of them. In the latter case, we denote by {\sigma}(R) the minimal number of…
Though network coding is traditionally performed over finite fields, recent work on nested-lattice-based network coding suggests that, by allowing network coding over certain finite rings, more efficient physical-layer network coding…
Consider a commutative monoid $(M,+,0)$ and a biadditive binary operation $\mu \colon M \times M \to M$. We will show that under some additional general assumptions, the operation $\mu$ is automatically both associative and commutative. The…
Motivated by linear network coding, communication channels perform linear operation over finite fields, namely linear operator channels (LOCs), are studied in this paper. For such a channel, its output vector is a linear transform of its…
In this article, we show that for a partial skew group ring R*G, where R is a commutative ring, each non-zero ideal of R*G intersects R non-trivially if and only if R is a maximal commutative subring of R*G. As a consequence, we obtain…