Related papers: MDS matrices from skew polynomials with automorphi…
In this paper, two classes of quantum MDS codes are constructed. The main tools are multiplicative structures on finite fields. Carefully choosing different cosets can make the corresponding generalized Reed-Solomon codes Hermitian…
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…
Maximum distance separable (MDS) codes are optimal error-correcting codes in the sense that they provide the maximum failure-tolerance for a given number of parity nodes. Suppose that an MDS code with $k$ information nodes and $r=n-k$…
MDS codes have garnered significant attention due to their wide applications in practice. To date, most known MDS codes are equivalent to Reed-Solomon codes. The construction of non-Reed-Solomon (non-RS) type MDS codes has emerged as an…
Let $A$ be a ring with identity, $\sigma$ a ring endomorphism of $A$ that maps the identity to itself, $\delta$ a $\sigma$-derivation of $A$, and consider the skew-polynomial ring $A[X;\sigma,\delta]$. When $A$ is a finite field, a Galois…
The matrix completion problem provides a unifying lens through which many fundamental problems in coding theory can be viewed. In this paper, we investigate Locally Recoverable Codes (LRCs) with Maximal Recoverability (MR) and Maximum…
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…
Symbol-pair code is a new coding framework which is proposed to correct errors in the symbol-pair read channel. In particular, maximum distance separable (MDS) symbol-pair codes are a kind of symbol-pair codes with the best possible…
This paper reports on the state-of-the-art in application of multidimensional scaling (MDS) techniques to create semantic maps in linguistic research. MDS refers to a statistical technique that represents objects (lexical items, linguistic…
In this work, free multivariate skew polynomial rings are considered, together with their quotients over ideals of skew polynomials that vanish at every point (which includes minimal multivariate skew polynomial rings). We provide a full…
In this work, we study linear codes with the folded Hamming distance, or equivalently, codes with the classical Hamming distance that are linear over a subfield. This includes additive codes. We study MDS codes in this setting and define…
A linear code with parameters $[n,k,n-k]$ is said to be almost maximum distance separable (AMDS for short). An AMDS code whose dual is also AMDS is referred to as an near maximum distance separable (NMDS for short) code. NMDS codes have…
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…
MDS convolutional codes have the property that their free distance is maximal among all codes of the same rate and the same degree. In this paper we introduce a class of MDS convolutional codes whose column distances reach the generalized…
It is an important task to construct quantum maximum-distance-separable (MDS) codes with good parameters. In the present paper, we provide six new classes of q-ary quantum MDS codes by using generalized Reed-Solomon (GRS) codes and…
Let $\mathbb{F}_{p^m}$ be the field containing $p^m$ elements where $p$ is an odd prime and $m \in \mathbb{N}$. In this article, we propose a unified approach to the study of skew constacyclic codes of length $np^s$ over the ring $R_k =…
In this article, for a finite field $\mathbb{F}_q$ and a natural number $l,$ let $\mathcal{R}$ denote the product ring $\mathbb{F}_q^l.$ Firstly, for an automorphism $\Theta$ of $\mathcal{R},$ a $\Theta$-derivation $\Delta_\Theta$ of…
We show that the free distance, as a function on a space parameterizing a family of convolutional codes, is a lower-semicontinuous function and that, therefore, the property of being Maximum Distance Separable (MDS) is an open condition.…
For high-rate maximum distance separable (MDS) codes, most of them are designed to optimally repair a single failed node by connecting all the surviving nodes. However, in practical systems, sometimes not all the surviving nodes are…
Finite dynamical systems (FDSs) are commonly used to model systems with a finite number of states that evolve deterministically and at discrete time steps. Considered up to isomorphism, those correspond to functional graphs. As such, FDSs…