Related papers: Superregular matrices over small finite fields
For a finite alphabet $\mathcal{A}$ and a sequence $x \in \mathcal{A}^{\mathbb{N}}$, Kamae and Zamboni defined the maximal pattern complexity function $p^*_x(n)$ as a natural generalization of usual word complexity. They defined a…
Locally repairable codes for distributed storage systems have gained a lot of interest recently, and various constructions can be found in the literature. However, most of the constructions result in either large field sizes and hence too…
Despite the popularity of low-rank matrix completion, the majority of its theory has been developed under the assumption of random observation patterns, whereas very little is known about the practically relevant case of non-random…
A Toeplitz matrix is one in which the matrix elements are constant along diagonals. The Fisher-Hartwig matrices are much-studied singular matrices in the Toeplitz family. The matrices are defined for all orders, $N$. They are parametrized…
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…
This paper studies Schauder theory to transmission problems modelled by fully nonlinear uniformly elliptic equations of second order. We focus on operators F that fails to be concave or convex in the space of symmetric matrices. In a first…
Here the definitions of nearest neighbor, robustness, concordance, and correlation, all of which feature in (Temple 2023) (henceforth abbreviated (T23)), are adjusted to make them completely mathematical while preserving their significance.…
Completely regular codes with covering radius $\rho=1$ must have minimum distance $d\leq 3$. For $d=3$, such codes are perfect and their parameters are well known. In this paper, the cases $d=1$ and $d=2$ are studied and completely…
We explore the asymptotic convergence and nonasymptotic maximal inequalities of supermartingales and backward submartingales in the space of positive semidefinite matrices. These are natural matrix analogs of scalar nonnegative…
We analyze a Hopfield neural network with a quasi-diagonal connection matrix. We use the term "quasi-diagonal matrix" to denote a matrix with all elements equal zero except the elements on the first super- and sub-diagonals of the principle…
Orthogonal and quasi-orthogonal matrices have a long history of use in digital image processing, digital and wireless communications, cryptography and many other areas of computer science and coding theory. The practical benefits of using…
Semipositive matrices (matrices that map at least one nonnegative vector to a positive vector) and minimally semipositive matrices (semipositive matrices whose no column-deleted submatrix is semipositive) are well studied in matrix theory.…
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…
We consider the problem of determining which matrices are permutable to be supmodular. We show that for small dimensions any matrix is permutable by a universal permutation or by a pair of permutations, while for higher dimensions no…
We study a class of parametrizations of convex cones of positive semidefinite matrices with prescribed zeros. Each such cone corresponds to a graph whose non-edges determine the prescribed zeros. Each parametrization in this class is a…
Let $A$ be an element of the copositive cone ${\cal C}_n$. A zero $u$ of $A$ is a nonzero nonnegative vector such that $u^TAu = 0$. The support of $u$ is the index set $\mbox{supp}u \subset \{1,\dots,n\}$ corresponding to the positive…
Numerical radius $r(A)$ is the radius of the smallest ball with the center at zero containing the field of values of a given square matrix $A$. It is well known that $r(A)\leq \|A\| \leq 2r(A)$, where $\| \cdot \|$ is the matrix 2-norm.…
An irreducible norm closed semigroup of complex matrices is simultaneously similar to a semigroup of partial isometries if and only if (a) the norms of all nonzero members of it are uniformly bounded above and below, and (b) its idempotents…
We consider the problem of computing the closest stable/unstable non-negative matrix to a given real matrix. This problem is important in the study of linear dynamical systems, numerical methods, etc. The distance between matrices is…
The construction of Maximum Distance Profile (MDP) convolutional codes in general requires the use of very large finite fields. In contrast convolutional codes with optimal column distances maximize the column distances for a given…