Related papers: A new class of superregular matrices and MDP convo…
In this article we study the structured distance to singularity for a nonsingular matrix $A\in\mathbb{C}^{n\times n}$, with a prescribed linear structure $\mathcal{S}$ (for instance, a sparsity pattern, or a real Toeplitz structure), i.e.,…
In two previous papers we constructed new families of completely regular codes by concatenation methods. Here we determine cases in which the new codes are completely transitive. For these cases we also find the automorphism groups of such…
In this paper, a class of optimization problems with nonlinear inequality constraints is discussed. Based on the ideas of sequential quadratic programming algorithm and the method of strongly sub-feasible directions, a new superlinearly…
A matrix is said to be {\it cyclic} if its characteristic polynomial is equal to its minimal polynomial. Cyclic matrices play an important role in some algorithms for matrix group computation, such as the Cyclic Meataxe developed by P. M.…
The method of little groups describes the irreducible characters of semidirect products with abelian normal subgroups in terms of the irreducible characters of the factor groups. We modify this method to construct supercharacter theories of…
We provide an algorithm to construct unitary matrices over finite fields. We present various constructions of Hermitian self-dual code by means of unitary matrices, where some of them generalize the quadratic double circulant constructions.…
By a theorem of Edrei, an infinite, normalised totally nonnegative upper-triangular Toeplitz matrix is determined by a pair of nonnegative parameter sequences, the `Schoenberg parameters', where nonzero parameters correspond to the roots…
In this paper, we produce new classes of MDS self-dual codes via (extended) generalized Reed-Solomon codes over finite fields of odd characteristic. Among our constructions, there are many MDS self-dual codes with new parameters which have…
We study sheaf codes, a type of linear codes with a fixed hierarchical collection of local codes, viewed as a sheaf of vector spaces on a finite topological space we call coded space. Many existing codes, such as tensor product codes,…
A subalgebra of the full matrix algebra Mn(K), K a field, satisfying the identity [x1, y1][x2, y2]...[xq, yq] = 0 is called a Dq subalgebra of Mn(K). In the paper we deal with the structure, conjugation and isomorphism problems of maximal…
Maximum distance profile (MDP) convolutional codes have the property that their column distances are as large as possible. It has been shown that, transmitting over an erasure channel, these codes have optimal recovery rate for windows of a…
In numerical analysis it is often necessary to estimate the condition number $CN(T)=||T||_{} \cdot||T^{-1}||_{}$ and the norm of the resolvent $||(\zeta-T)^{-1}||_{}$ of a given $n\times n$ matrix $T$. We derive new spectral estimates for…
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…
The present paper focuses on the construction of a set of submatrices of a circulant matrix such that it is a smaller set to verify that the circulant matrix is an MDS (maximum distance separable) one, comparing to the complete set of…
In this paper, we construct self-dual codes from a construction that involves 2x2 block circulant matrices, group rings and a reverse circulant matrix. We provide conditions whereby this construction can yield self-dual codes. We construct…
The new classes of super special codes are constructed in this book using the specially constructed super special vector spaces. These codes mainly use the super matrices. These codes can be realized as a special type of concatenated codes.…
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…
Maximum Distance Separable (MDS) convolutional codes are cha- racterized through the property that the free distance meets the generalized Singleton bound. The existence of free MDS convolutional codes over Z p r was recently discovered in…
In this work, we present new constructions for topological subsystem codes using semi-regular Euclidean and hyperbolic tessellations. They give us new families of codes, and we also provide a new family of codes obtained through an already…
The purposes of this paper are to classify lower triangular forms and to determine under what conditions a nonlinear system is equivalent to a specific type of lower triangular forms. According to the least multi-indices and the greatest…