Related papers: Linear Network Coding over Rings, Part I: Scalar C…
In this paper, new and significant advances on the understanding the structure of p.p. rings and their generalizations have been made. Especially among them, it is proved that a commutative ring $R$ is a generalized p.p. ring if and only if…
Tensor train (TT) decomposition is a powerful representation for high-order tensors, which has been successfully applied to various machine learning tasks in recent years. However, since the tensor product is not commutative, permutation of…
In this note we prove the following fact: if finite many elements $p_1,p_2,...,p_n$ of a unique factorization domain are given such that the greatest common divisor of each pair $(p_i,p_j)$ can be expressed as a linear combination of $p_i$…
Random Linear Network Coding (RLNC) provides a theoretically efficient method for coding. Some of its practical drawbacks are the complexity of decoding and the overhead due to the coding vectors. For computationally weak and battery-driven…
We introduce several commutative rings, the snake rings, that have strong connections to cluster algebras. The elements of these rings are residue classes of unions of certain labeled graphs that were used to construct canonical bases in…
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$?…
Following the approach by R. K\"otter and F. R. Kschischang, we study network codes as families of k-dimensional linear subspaces of a vector space F_q^n, q being a prime power and F_q the finite field with q elements. In particular,…
Linear codes are widely studied in coding theory as they have nice applications in distributed storage, combinatorics, lattices, cryptography and so on. Constructing linear codes with desirable properties is an interesting research topic.…
In this paper, we consider the Reed-Muller (RM) codes. For the first order RM code, we prove that it is unique in the sense that any linear code with the same length, dimension and minimum distance must be the first order RM code; For the…
The paper is devoted to studying the orthogonality graph of the matrix ring over a commutative ring. It is proved that the orthogonality graph of the ring of matrices with size greater than 1 over a commutative ring with zero-divisors is…
In recent years, the rapidly increasing amounts of data created and processed through the internet resulted in distributed storage systems employing erasure coding based schemes. Aiming to balance the tradeoff between data recovery for…
We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…
It is known that a linear code can be represented by a binomial ideal. In this paper, we give standard bases for the ideals in a localization of the multivariate polynomial ring in the case of linear codes over prime fields.
We study matroidal networks introduced by Dougherty et al. We prove the converse of the following theorem: If a network is scalar-linearly solvable over some finite field, then the network is a matroidal network associated with a…
Let $K$ be a number field, ${\mathcal O}_K$ its ring of integers, and $f(x, y) \in {\mathcal O}_K[x, y]$ a binary form with integer coefficents. For any given prime $p \in {\mathcal O}_K$ we determine explicitly a binary form $g$ (resp.…
An index code is said to be locally decodable if each receiver can decode its demand using its side information and by querying only a subset of the transmitted codeword symbols instead of observing the entire codeword. Local decodability…
We study a matrix-based notion of matroid representation over local commutative rings obtained by replacing linear independence with modular independence. This construction always defines an independence system, though not necessarily a…
We introduce higher-dimensional module factorizations associated to a regular sequence. They include higher-dimensional matrix factorizations, which are commutative cubes consisting of free modules with edges being classical matrix…
It is shown that every commutative local ring of bounded module type is an almost maximal valuation ring.
Let $R$ be a ring (not necessary commutative) with non-zero identity. The unit graph of $R$, denoted by $G(R)$, is a graph with elements of $R$ as its vertices and two distinct vertices $a$ and $b$ are adjacent if and only if $a+b$ is a…