Related papers: Linear Network Coding over Rings, Part I: Scalar C…
Messages in communication networks often are considered as "discrete" taking values in some finite alphabet (e.g. a finite field). However, if we want to consider for example communication based on analogue signals, we will have to consider…
One open problem in source coding is to characterize the limits of representing losslessly a non-identity discrete function of the data encoded independently by the encoders of several correlated sources with memory. This paper investigates…
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented over finite fields whose size depends on some global network parameters…
We establish basic results on subrings of finite commutative rings and closely related rings. Among other applications we calculate the number of maximal subrings of a finite commutative local ring.
Sum-networks are networks where all the terminals demand the sum of the symbols generated at the sources. It has been shown that for any finite set/co-finite set of prime numbers, there exists a sum-network which has a vector linear…
In this paper, we use elementary and simple ideas which are based on the significant applications of the power set ring to rebuild and study the patch topology on the prime spectrum from a completely different and new point of view.…
A commutative order in a quaternion algebra is called selective if it is embeds into some, but not all, the maximal orders in the algebra. It is known that a given quadratic order over a number field can be selective in at most one…
A linear code of length $n$ over a finite chain ring $R$ with residue field $\F_q$ is a $R$-submodule of $R^n$. A $R$-linear code is a code over $\F_q$ (not necessarily linear) which is the generalized Gray map image of a linear code over…
We consider a two-unicast-$Z$ network over a directed acyclic graph of unit capacitated edges; the two-unicast-$Z$ network is a special case of two-unicast networks where one of the destinations has apriori side information of the unwanted…
One fundamental problem in the field of network coding is to determine the network coding capacity of networks under various network coding schemes. In this thesis, we address the problem with two approaches: matroidal networks and capacity…
In this paper, the determinants of $n\times n$ matrices over commutative finite chain rings and over commutative finite principal ideal rings are studied. The number of $n\times n$ matrices over a commutative finite chain ring ${R}$ of a…
Circular-shift linear network coding (LNC) is a class of vector LNC with local encoding kernels selected from cyclic permutation matrices, so that it has low coding complexities. However, it is insufficient to exactly achieve the capacity…
Let $R$ be a not necessarily commutative ring with $1.$ In the present paper we first introduce a notion of quasi-orderings, which axiomatically subsumes all the orderings and valuations on $R$. We proceed by uniformly defining a coarsening…
The Ring Loading Problem is an optimal routing problem arising in the planning of optical communication networks which use bidirectional SONET rings. In mathematical terms, it is an unsplittable multicommodity flow problem on undirected…
A ring $R$ is called strongly clean if every element of $R$ is the sum of a unit and an idempotent that commute. By {\rm SRC} factorization, Borooah, Diesl, and Dorsey \cite{BDD051} completely determined when ${\mathbb M}_n(R)$ over a…
In this paper we study maximal subrings up to isomorphism of fields. It is shown that each field with zero characteristic has infinitely many maximal subrings up to isomorphism. If $K$ is an algebraically closed field and $x$ is an…
Many kinds of codes which possess two cycle structures over two special finite commutative chain rings, such as ${\Bbb Z}_2{\Bbb Z}_4$-additive cyclic codes and quasi-cyclic codes of fractional index etc., were proved asymptotically good.…
In this paper we investigate codes over finite commutative rings R, whose generator matrices are built from \$\alpha\$-circulant matrices. For a non-trivial ideal I<R we give a method to lift such codes over R/I to codes over R, such that…
We describe a method for solving linear systems over the localization of a commutative ring $R$ at a multiplicatively closed subset $S$ that works under the following hypotheses: the ring $R$ is coherent, i.e., we can compute finite…
By a ring we always mean a commutative ring with identity. It is well known that maximal spectrum of $C(X)$, $C^*(X)$ and any intermediate subrings between $C(X)$ and $C^* (X)$ are homeomorphic and homeomorphic with $\beta X$, the…