相关论文: A note on MDS Property of Circulant Matrices

We investigate when a maximum distance separable ($MDS$) code over $F_q$ is also completely regular ($CR$). For lengths $n=q+1$ and $n=q+2$ we provide a complete classification of the $MDS$ codes that are $CR$ or at least uniformly packed…

Algebraic methods for the design of series of maximum distance separable (MDS) linear block and convolutional codes to required specifications and types are presented. Algorithms are given to design codes to required rate and required…

In this paper, we use Breadth-first search algorithm to determine the distance matrix of multiplicative circulant graph of order power of two and three. As a consequence, the diameter of the graphs were determined. We also give their…

M dwarfs are prime targets in the hunt for habitable worlds around other stars. This is due to their abundance as well as their small radii and low masses and temperatures, which facilitate the detection of temperate, rocky planets in orbit…

Let $\mathbb{F}_q$ be the finite field of $q$ elements, where $q=p^{m}$ with $p$ being a prime number and $m$ being a positive integer. Let $\mathcal{C}_{(q, n, \delta, h)}$ be a class of BCH codes of length $n$ and designed $\delta$. A…

Let $\mathbb{F}$ be a finite field of odd characteristic. When $|\mathbb{F}|\ge 5$, we prove that every matrix $A$ admits a decomposition into $D+M$ where $D$ is diagonalizable and $M^2=0$. For $\mathbb{F}=\mathbb{F}_3$, we show that such…

Linear complementary dual (LCD) maximum distance separable (MDS) codes are constructed to given specifications. For given $n$ and $r<n$, with $n$ or $r$ (or both) odd, MDS LCD $(n,r)$ codes are constructed over finite fields whose…

In this paper, by using the theory of circulant matrices we study some matrices over finite fields which involve the quadratic character and trinomial coefficients.

The statistical shape analysis called Procrustes analysis minimizes the distance between matrices by similarity transformations. The method returns a set of optimal orthogonal matrices, which project each matrix into a common space. This…

This paper is a sequel to Chaika and Krishnan [arXiv:1612.00434]. We again consider translation invariant measures on families of nearest-neighbor semi-infinite walks on the integer lattice Z^d. We assume that once walks meet, they…

Maximum distance separable (MDS) codes are very important in both theory and practice. There is a classical construction of a family of $[2^m+1, 2u-1, 2^m-2u+3]$ MDS codes for $1 \leq u \leq 2^{m-1}$, which are cyclic, reversible and BCH…

Distances in the conformal manifold, the space of CFTs related by marginal deformations, can be measured in terms of the Zamolodchikov metric. Part of the CFT Distance Conjecture posits that points in this manifold where part of the…

We consider the Minimum Dominating Set (MDS) problem on the intersection graphs of geometric objects. Even for simple and widely-used geometric objects such as rectangles, no sub-logarithmic approximation is known for the problem and…

We show that the symmetric difference distance measure for set systems, and more specifically for delta-matroids, corresponds to the notion of nullity for symmetric and skew-symmetric matrices. In particular, as graphs (i.e., symmetric…

Near MDS (NMDS) codes are closely related to interesting objects in finite geometry and have nice applications in combinatorics and cryptography. But there are many unsolved problems about construction of NMDS codes. In this paper, by using…

We study the problem when every matrix over a division ring is representable as either the product of traceless matrices or the product of semi-traceless matrices, and also give some applications of such decompositions. Specifically, we…

Multidimensional scaling (MDS) is a popular technique for mapping a finite metric space into a low-dimensional Euclidean space in a way that best preserves pairwise distances. We overview the theory of classical MDS, along with its…

Quantum stabilizer states over GF(m) can be represented as self-dual additive codes over GF(m^2). These codes can be represented as weighted graphs, and orbits of graphs under the generalized local complementation operation correspond to…

Two-dimensional ideal incompressible magnetohydrodynamic (MHD) linear waves at the surface of a rotating sphere are studied as a model to imitate the outermost layer of the Earth's core or the solar tachocline. This thin conducting layer is…

This paper deals with the problem of constructing superregular matrices that lead to MDP convolutional codes. These matrices are a type of lower block triangular Toeplitz matrices with the property that all the square submatrices that can…