Related papers: On general self-orthogonal matrix-product codes as…
The unextendible orthogonal matrices (UPBs) can be used for various problems in quantum information. We provide an algorithm to check if two UPBs are non-equivalent to each other. We give a method to construct UPBs and we apply this method…
Matrices over the dual numbers are considered. We propose an approach to classify these matrices up to similarity. Some preliminary results on the realization of this approach are obtained. In particular, we produce explicitly canonical…
This paper presents two universal algorithms for generalized Bellman equations with symmetric Toeplitz matrix. The algorithms are semiring extensions of two well-known methods solving Toeplitz systems in the ordinary linear algebra.
We consider polynomial codes for private distributed matrix multiplication (PDMM/SDMM). Existing codes for PDMM are either specialized for the outer product partitioning (OPP), or inner product partitioning (IPP), or are valid for the more…
The Erlangian approximation of Markovian fluid queues leads to the problem of computing the matrix exponential of a subgenerator having a block-triangular, block-Toeplitz structure. To this end, we propose some algorithms which exploit the…
Generalized Locally Toeplitz (GLT) matrix sequences arise from large linear systems that approximate Partial Differential Equations (PDEs), Fractional Differential Equations (FDEs), and Integro-Differential Equations (IDEs). GLT sequences…
In this paper we study the eigenvalues of Hermitian Toeplitz matrices with the entries $2,-1,0,\ldots,0,-\alpha$ in the first column. Notice that the generating symbol depends on the order $n$ of the matrix. If $|\alpha|\le 1$, then the…
As a result of their applications in network coding, space-time coding, and coding for criss-cross errors, matrix codes have garnered significant attention; in various contexts, these codes have also been termed rank-metric codes,…
A new construction of codes from old ones is considered, it is an extension of the matrix-product construction. Several linear codes that improve the parameters of the known ones are presented.
We introduce a class of subproduct systems of finite dimensional Hilbert spaces whose fibers are defined by the Jones-Wenzl projections in Temperley-Lieb algebras. The quantum symmetries of a subclass of these systems are the free…
We have generalised the properties with the tensor product, of one 4x4 matrix which is a permutation matrix, and we call a tensor commutation matrix. Tensor commutation matrices can be constructed with or without calculus. A formula allows…
We present a general construction of asymmetric quantum codes based on additive codes under the trace Hermitian inner product. Various families of additive codes over $\F_{4}$ are used in the construction of many asymmetric quantum codes…
In this paper, we discuss index theory for Toeplitz operators on a discrete quarter-plane of two-variable rational matrix function symbols. By using Gohberg-Krein theory for matrix factorizations, we extend the symbols defined originally on…
A new condition, the strong inner product property, is introduced and used to construct sign patterns of row orthogonal matrices. Using this property, infinite families of sign patterns allowing row orthogonality are found. These provide…
Locally repairable codes have become a key instrument in large-scale distributed storage systems. This paper focuses on the construction of locally repairable codes with $(r,\delta)$-locality that achieve the equality in the Singleton-type…
Binary matrix codes with restricted row and column weights are a desirable method of coded modulation for power line communication. In this work, we construct such matrix codes that are obtained as products of affine codes - cosets of…
For the family of the orthogonal quantum matrix algebras we investigate the structure of their characteristic subalgebras -- special commutative subalgebras, which for the subfamily of the reflection equation algebras appear to be central.…
In this paper, a criterion of MDS Euclidean self-orthogonal codes is presented. New MDS Euclidean self-dual codes and self-orthogonal codes are constructed via this criterion. In particular, among our constructions, for large square $q$,…
We discuss a system of third order PDEs for strictly convex smooth functions on domains of Euclidean space. We argue that it may be understood as a closure of sorts of the first order prolongation of a family of second order PDEs. We…
The computation of the structured pseudospectral abscissa and radius (with respect to the Frobenius norm) of a Toeplitz matrix is discussed and two algorithms based on a low rank property to construct extremal perturbations are presented.…