Related papers: Linear Network Coding over Rings, Part II: Vector …
Explicit characterization of the capacity region of communication networks is a long standing problem. While it is known that network coding can outperform routing and replication, the set of feasible rates is not known in general.…
We study sequences of linear or affine codes with uniform weight spectrum, i.e., a part of codewords with any fixed weight tends to zero. It is proved that a sequence of linear codes has a uniform weight spectrum if the number of vectors…
We investigate $k$-nets with $k\geq 4$ embedded in the projective plane $PG(2,\mathbb{K})$ defined over a field $\mathbb{K}$; they are line configurations in $PG(2,\mathbb{K})$ consisting of $k$ pairwise disjoint line-sets, called…
A ring R is said to be of stable range 1.5 if for each a, b from R and nonzero c from R satisfying aR + bR + cR = R there exists r from R such that (a + br)R + cR = R. Let R be a commutative domain in which all finitely generated ideals are…
The main result here is a characterisation of binary $2$-neighbour-transitive codes with minimum distance at least $5$ via their minimal subcodes, which are found to be generated by certain designs. The motivation for studying this class of…
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…
Invariants for complicated objects such as those arising in phylogenetics, whether they are invariants as matrices, polynomials, or other mathematical structures, are important tools for distinguishing and working with such objects. In this…
Let \pi(G) denote the set of prime divisors of the order of a finite group G. The prime graph of G is the graph with vertex set \pi(G) with edges {p,q} if and only if there exists an element of order pq in G. In this paper, we prove that a…
Layer normalization (LN) is a ubiquitous technique in deep learning but our theoretical understanding to it remains elusive. This paper investigates a new theoretical direction for LN, regarding to its nonlinearity and representation…
A subalgebra of a semisimple Lie algebra is wide if every simple module of the semisimple Lie algebra remains indecomposable when restricted to the subalgebra. From a finer viewpoint, a subalgebra is $\lambda$-wide if the simple module of a…
The constrained linear representability problem (CLRP) for polymatroids determines whether there exists a polymatroid that is linear over a specified field while satisfying a collection of constraints on the rank function. Using a computer…
Let $m \geq 2$ be an integer, and let $\mathbb{F}_q$ be the finite field of prime power order $q.$ Let $\mathcal{R}=\frac{\mathbb{F}_q[u]}{\langle u^2 \rangle}\times \mathbb{F}_q$ be the mixed-alphabet ring, where…
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…
We study vector bundles on the moduli stack of elliptic curves over a local ring R. If R is a field or a discrete valuation ring of (residue) characteristic not 2 or 3, all these vector bundles are sums of line bundles. For R the 3-local…
Sorting networks are oblivious sorting algorithms with many practical applications and rich theoretical properties. Propositional encodings of sorting networks are a key tool for proving concrete bounds on the minimum number of comparators…
A large family of linear codes with flexible parameters from almost bent functions and perfect nonlinear functions are constructed and their parameters are determined. Some constructed linear codes and their related codes are optimal in the…
We say that a linear code C over a field F is triangular representable if there exists a two dimensional simplicial complex $\Delta$ such that C is a punctured code of the kernel ker $\Delta$ of the incidence matrix of $\Delta$ over F and…
In this paper, we study convolutional codes with a specific cyclic structure. By definition, these codes are left ideals in a certain skew polynomial ring. Using that the skew polynomial ring is isomorphic to a matrix ring we can describe…
A matroid is supersolvable if it has a maximal chain of flats each of which is modular. A matroid is saturated if every round flat is modular. In this article we present supersolvable saturated matroids as analogues to chordal graphs, and…
We prove that if two linear codes are equivalent then they are semi-linearly equivalent. We also prove that if two additive MDS codes over a field are equivalent then they are additively equivalent.