Related papers: On general self-orthogonal matrix-product codes as…
The motivation of this paper is twofold. First, we investigate the block-diagonalization of the $z$-block circulant matrix $\mathtt{bcirc_z}(\mathcal A)$, based on this block-diagonal structure, and develop the algorithm…
We consider the symmetric Toeplitz matrix completion problem, whose matrix under consideration possesses specific row and column structures. This problem, which has wide application in diverse areas, is well-known to be computationally…
Sobolev orthogonal polynomials are polynomials orthogonal with respect to a Sobolev inner product, an inner product in which derivatives of the polynomials appear. They satisfy a long recurrence relation that can be represented by a…
In this paper, we demonstrate an elementary method for constructing new solutions to Bochner's problem for matrix differential operators from known solutions. We then describe a large family of solutions to Bochner's problem, obtained from…
Linear codes are widely studied due to their applications in communication, cryptography, quantum codes, distributed storage and many other fields. In this paper, we use the trace and norm functions over finite fields to construct a family…
We introduce the wedge product of two polytopes. The wedge product is described in terms of inequality systems, in terms of vertex coordinates as well as purely combinatorially, from the corresponding data of its constituents. The wedge…
Kim et al. (2021) gave a method to embed a given binary $[n,k]$ code $\mathcal{C}$ $(k = 3, 4)$ into a self-orthogonal code of the shortest length which has the same dimension $k$ and minimum distance $d' \ge d(\mathcal{C})$. We extend this…
We begin this chapter by introducing the simple algebraic structure of cyclic codes over finite fields. This structure undergoes a series of generalizations to present algebraic descriptions of constacyclic, quasi-cyclic (QC), quasi-twisted…
We characterize a family of number triangles whose production matrices are closely related to the original number triangle. We study a number of such triangles that are of combinatorial significance. For a specific subfamily, these…
We introduce a new class of two(multi)-matrix models of positive Hermitean matrices coupled in a chain; the coupling is related to the Cauchy kernel and differs from the exponential coupling more commonly used in similar models. The…
In several applications, one must estimate a real-valued (symmetric) Toeplitz covariance matrix, typically shifted by the conjugated diagonal matrices of phase progression and phase "calibration" errors. Unlike the Hermitian Toeplitz…
In this paper we show, how a straightforward and natural application of a pair of fundamental identities valid for polynomials orthogonal over the unit circle, can be used to calculate the determinant of the finite Toeplitz matrix, $$…
We relate polyhedral products of topological spaces to graph products of groups. The loop homology algebras of polyhedral products are identified with the universal enveloping algebras of the Lie algebras associated with central series of…
The study of optical orthogonal codes has been motivated by an application in an optical code-division multiple access system. This paper focuses on optimal two-dimensional optical orthogonal codes with autocorrelation and cross-correlation…
Truncated Toeplitz operators in a model space are C--symmetric with respect to a natural conjugation in that space. We show that this and another conjugation associated to an orthogonal decomposition possess unique properties and we study…
We consider block-structured matrices $A_n$, where the blocks are of (block) unilevel Toeplitz type with $s\times t$ matrix-valued generating functions. Under mild assumptions on the size of the (rectangular) blocks, the asymptotic…
Compound matrices play an important role in many fields of mathematics and have recently found new applications in systems and control theory. However, the explicit formulas for these compounds are non-trivial and not always easy to use.…
We describe the recursive algorithmic procedure to compute the stabilizers of the group of complex orthogonal matrices with respect to the action of similarity on the set of all symmetric matrices. Futhermore, lower bounds for dimensions of…
This work provides explicit characterizations and formulae for the minimal polynomials of a wide variety of structured $4\times 4$ matrices. These include symmetric, Hamiltonian and orthogonal matrices. Applications such as the complete…
In this paper a construction of quantum codes from self-orthogonal algebraic geometry codes is provided. Our method is based on the CSS construction as well as on some peculiar properties of the underlying algebraic curves, named Swiss…