In this paper we present a concrete algebraic construction of a novel class of convolutional codes. These codes are built upon generalized Vandermonde matrices and therefore can be seen as a natural extension of Reed-Solomon block codes to the context of convolutional codes. For this reason we call them weighted Reed-Solomon (WRS) convolutional codes. We show that under some constraints on the defining parameters these codes are Maximum Distance Profile (MDP), which means that they have the maximal possible growth in their column distance profile. We study the size of the field needed to obtain WRS convolutional codes which are MDP and compare it with the existing general constructions of MDP convolutional codes in the literature, showing that in many cases WRS convolutional codes require significantly smaller fields.
This paper proposes a new class of multi-dimensional nonsystematic Reed-Solomon codes that are constructed based on the multi-dimensional Fourier transform over a finite field. The proposed codes are the extension of the nonsystematic Reed-Solomon codes to multi-dimension. This paper also discusses the performance of the multi-dimensional nonsystematic Reed-Solomon codes.
Maximum distance separable (MDS) codes are optimal where the minimum distance cannot be improved for a given length and code size. Twisted Reed-Solomon codes over finite fields were introduced in 2017, which are generalization of Reed-Solomon codes. Twisted Reed-Solomon codes can be applied in cryptography which prefer the codes with large minimum distance. MDS codes can be constructed from twisted Reed-Solomon codes, and most of them are not equivalent to Reed-Solomon codes. In this paper, we first generalize twisted Reed-Solomon codes to generalized twisted Reed-Solomon codes, then we give s…
The new method for Reed-Solomon codes decoding is introduced. The method is based on the star trellis decoding of the binary image of Reed-Solomon codes.
In this paper, by calculating the dual code of the Schur square for the standard twisted Reed-Solomon code, we give a sufficient and necessary condition for the generalized twisted Reed-Solomon code with $h+t\le k-1$ to be self-orthogonal, where $k$ is dimension, $h$ is hook and $t$ is twist. And then, we show that there is no self-orthogonal generalized twisted Reed-Solomon code under some conditions. Furthermore, several classes of self-orthogonal generalized twisted Reed-Solomon codes are constructed, and some of these codes are non-GRS self-orthogonal MDS codes or NMDS codes.
We propose an alternative method for collaborative decoding of interleaved Reed-Solomon codes. Simulation results for a concatenated coding scheme using polar codes as inner codes are included.
Interleaved Reed-Solomon codes are applied in numerous data processing, data transmission, and data storage systems. They are generated by interleaving several codewords of ordinary Reed-Solomon codes. Usually, these codewords are decoded independently by classical algebraic decoding methods. However, by collaborative algebraic decoding approaches, such interleaved schemes allow the correction of error patterns beyond half the minimum distance, provided that the errors in the received signal occur in bursts. In this work, collaborative decoding of interleaved Reed-Solomon codes by multi-sequen…
We define a virtual projection of a Reed-Solomon code $RS(q^{l},n,k)$ to an $RS(q,n,k)$ Reed-Solomon code. A new probabilistic decoding algorithm that can be used to perform fractional decoding beyond the $α$- decoding radius is considered. An upper bound for the failure probability of the new algorithm is given, and the performance is illustrated by examples.
It is well-known that Reed-Solomon codes and extended Reed-Solomon codes are two special classes of MDS codes with wide applications in practice. The complete weight enumerators of these codes are very important for determining the capability of both error-detection and error-correction. In this paper, for any positive integer $m$ and prime $p$, basing on the character sums, we determine the complete weight enumerators of the Reed-Solomon code and the extended Reed-Solomon code with dimension $k$ $(k=2,3)$ over $\mathbb{F}_{p^m}$, explictly, which are generalizations of the corresponding resul…
In this paper, by using some properties for linear algebra methods, the parity-check matrices for twisted generalized Reed-Solomon codes with any given hook $h$ and twist $t$ are presented, and then a sufficient and necessary condition for the twisted generalized Reed-Solomon code with $h\ge t$ to be self-dual is given. Furthermore, several classes of self-dual codes with small Singleton defect are constructed based on twisted generalized Reed-Solomon codes, especially some of these self-dual codes are MDS or NMDS.
We propose to reduce the decoding complexity of polar codes with non-Arikan kernels by employing a (near) ML decoding algorithm for the codes generated by kernel rows. A generalization of the order statistics algorithm is presented for soft decoding of Reed-Solomon codes. Algebraic properties of the Reed-Solomon code are exploited to increase the reprocessing order. The obtained algorithm is used as a building block to obtain a decoder for polar codes with Reed-Solomon kernel.
This paper presents a method to determine a set of basis polynomials from the extended Euclidean algorithm that allows Generalized Minimum Distance decoding of Reed-Solomon codes with a complexity of O(nd).
The hull of a linear code is defined to be the intersection of the code and its dual. When the size of the hull is small, it has been proved that some algorithms for checking permutation equivalence of two linear codes and computing the automorphism group of a linear code are very effective in general. Maximum distance separable (MDS) codes are codes meeting the Singleton bound. Twisted Reed-Solomon codes is a generalization of Reed-Solomon codes, which is also a nice construction for MDS codes. In this short letter, we obtain some twisted Reed-Solomon MDS codes with one-dimensional hull. More…
Reed-Solomon codes and Gabidulin codes have maximum Hamming distance and maximum rank distance, respectively. A general construction using skew polynomials, called skew Reed-Solomon codes, has already been introduced in the literature. In this work, we introduce a linearized version of such codes, called linearized Reed-Solomon codes. We prove that they have maximum sum-rank distance. Such distance is of interest in multishot network coding or in singleshot multi-network coding. To prove our result, we introduce new metrics defined by skew polynomials, which we call skew metrics, we prove that…
Both linear complementary dual (LCD) codes and maximum distance separable (MDS) codes have good algebraic structures, and they have interesting practical applications such as communication systems, data storage, quantum codes, and so on. So far, most of LCD MDS codes have been constructed by employing generalized Reed-Solomon codes. In this paper we construct some classes of new Euclidean LCD MDS codes and Hermitian LCD MDS codes which are not monomially equivalent to Reed-Solomon codes, called LCD MDS codes of non-Reed- Solomon type. Our method is based on the constructions of Beelen et al. (…
Two concatenated coding schemes incorporating algebraic Reed-Solomon (RS) codes and polarization-adjusted convolutional (PAC) codes are proposed. Simulation results show that at a bit error rate of $10^{-5}$, a concatenated scheme using RS and PAC codes has more than $0.25$ dB coding gain over the NASA standard concatenation scheme, which uses RS and convolutional codes.
This paper presents a method to merge Generalized Minimum Distance decoding of Reed-Solomon codes with the extended Euclidean algorithm. By merge, we mean that the steps taken to perform the Generalized Minimum Distance decoding are similar to those performed by the extended Euclidean algorithm. The resulting algorithm has a complexity of O(n^2).
Because of their importance in applications and their quite simple definition, Reed-Solomon codes can be explained in any introductory course on coding theory. However, decoding algorithms for Reed-Solomon codes are far from being simple and it is difficult to fit them in introductory courses for undergraduates. We introduce a new decoding approach, in a self-contained presentation, which we think may be appropriate for introducing error correction of Reed-Solomon codes to nonexperts. In particular, we interpret Reed-Solomon codes by means of the degree of the interpolation polynomial of the c…
In this paper, deep holes of Reed-Solomon (RS) codes are studied. A new class of deep holes for generalized affine RS codes is given if the evaluation set satisfies certain combinatorial structure. Three classes of deep holes for projective Reed-Solomon (PRS) codes are constructed explicitly. In particular, deep holes of PRS codes with redundancy three are completely obtained when the characteristic of the finite field is odd. Most (asymptotically of ratio $1$) of the deep holes of PRS codes with redundancy four are also obtained.
Insertion and deletion (insdel for short) errors are synchronization errors in communication systems caused by the loss of positional information in the message. Reed-Solomon codes have gained a lot of interest due to its encoding simplicity, well structuredness and list-decoding capability in the classical setting. This interest also translates to the insdel metric setting, as the Guruswami-Sudan decoding algorithm can be utilized to provide a deletion correcting algorithm in the insdel metric. Nevertheless, there have been few studies on the insdel error-correcting capability of Reed-Solomon…
In this paper, a new algebraic soft-decision decoding algorithm for Reed-Solomon code is presented. It is based on rational interpolation and the interpolation points are constructed by Berlekamp-Messay algorithm. Unlike the traditional K{ö}tter-Vardy algorithm, new algorithm needs interpolation for two smaller multiplicity matrixes, due to the corresponding factorization algorithm for re-constructing codewords.
An alternative method for collaborative decoding of interleaved Reed-Solomon codes as well as Gabidulin codes for the case of high interleaving degree is proposed. As an example of application, simulation results are presented for a concatenated coding scheme using polar codes as inner codes.
Reed--Solomon codes are a well--studied code class which fulfill the Singleton bound with equality. However, their length is limited to the size $q$ of the underlying field $\mathbb{F}_q$. In this paper we present a code construction which yields codes with lengths of factors of the field size. Furthermore a decoding algorithm beyond half the minimum distance is given and analyzed.
Based on the fundamental results on MDS self-dual codes over finite fields constructed via generalized Reed-Solomon codes \cite{JX} and extended generalized Reed-Solomon codes \cite{Yan}, many series of MDS self-dual codes with different length have been obtained recently by a variety of constructions and individual computations. In this paper, we present an unified approach to get several previous results with concise statements and simplified proofs, and some new constructions on MDS self-dual codes. In the conclusion section we raise two open problems.
We present a new general construction of MDS codes over a finite field $\mathbb{F}_q$. We describe two explicit subclasses which contain new MDS codes of length at least $q/2$ for all values of $q \ge 11$. Moreover, we show that most of the new codes are not equivalent to a Reed-Solomon code.
Linearized Reed-Solomon (LRS) codes are sum-rank metric codes that fulfill the Singleton bound with equality. In the two extreme cases of the sum-rank metric, they coincide with Reed-Solomon codes (Hamming metric) and Gabidulin codes (rank metric). List decoding in these extreme cases is well-studied, and the two code classes behave very differently in terms of list size, but nothing is known for the general case. In this paper, we derive a lower bound on the list size for LRS codes, which is, for a large class of LRS codes, exponential directly above the Johnson radius. Furthermore, we show t…
The complexity of maximal likelihood decoding of the Reed-Solomon codes $[q-1, k]_q$ is a well known open problem. The only known result in this direction states that it is at least as hard as the discrete logarithm in some cases where the information rate unfortunately goes to zero. In this paper, we remove the rate restriction and prove that the same complexity result holds for any positive information rate. In particular, this resolves an open problem left in [4], and rules out the possibility of a polynomial time algorithm for maximal likelihood decoding problem of Reed-Solomon codes of an…
A codeword is associated to a linearized polynomial. The weight distribution of the codewords is determined as the linearized polynomial varies in a family of fixed degree. There is a corresponding result on Wenger graphs from linearized polynomials.
The key step of syndrome-based decoding of Reed-Solomon codes up to half the minimum distance is to solve the so-called Key Equation. List decoding algorithms, capable of decoding beyond half the minimum distance, are based on interpolation and factorization of multivariate polynomials. This article provides a link between syndrome-based decoding approaches based on Key Equations and the interpolation-based list decoding algorithms of Guruswami and Sudan for Reed-Solomon codes. The original interpolation conditions of Guruswami and Sudan for Reed-Solomon codes are reformulated in terms of a se…
In this paper, we produce some new classes of entanglement-assisted quantum MDS codes(EAQMDS codes for short) via generalized Reed-Solomon codes over finite fields of odd characteristic. Among our constructions, there are many EAQMDS codes with new lengths which have never been reported. Moreover, some of them have larger minimum distance than known results.
A transform that enables generator-matrix-based Reed-Solomon (RS) coded data to be recovered under interpolation-based list decoding is presented. The transform matrix needs to be computed only once and the transformation of an element from the output list to the desired RS coded data block incurs $k^{2}$ field multiplications, given a code of dimension $k$.
For a linear code, deep holes are defined to be vectors that are further away from codewords than all other vectors. The problem of deciding whether a received word is a deep hole for generalized Reed-Solomon codes is proved to be co-NP-complete. For the extended Reed-Solomon codes $RS_q(\F_q,k)$, a conjecture was made to classify deep holes by Cheng and Murray in 2007. Since then a lot of effort has been made to prove the conjecture, or its various forms. In this paper, we classify deep holes completely for generalized Reed-Solomon codes $RS_p (D,k)$, where $p$ is a prime, $|D| > k \geqslant …
MDS codes and self-dual codes are important families of classical codes in coding theory. It is of interest to investigate MDS self-dual codes. The existence of MDS self-dual codes over finite field $F_q$ is completely solved for $q$ is even. In this paper, for finite field with odd characteristic, we construct some new classes of MDS self-dual codes by (extended) generalized Reed-Solomon codes.
Reed-Solomon codes have found many applications in practical storage systems, but were until recently considered unsuitable for distributed storage applications due to the widely-held belief that they have poor repair bandwidth. The work of Guruswami and Wootters (STOC'16) has shown that one can actually perform bandwidth-efficient linear repair with Reed-Solomon codes: When the codes are over the field $\mathbb{F}_{q^t}$ and the number of parities $r \geq q^s$, where $(t-s)$ divides $t$, there exists a linear scheme that achieves a repair bandwidth of $(n-1)(t-s)\log_2 q$ bits. We extend this…
In this paper, we reduce the computational complexities of partial and dual partial cyclotomic FFTs (CFFTs), which are discrete Fourier transforms where spectral and temporal components are constrained, based on their properties as well as a common subexpression elimination algorithm. Our partial CFFTs achieve smaller computational complexities than previously proposed partial CFFTs. Utilizing our CFFTs in both transform- and time-domain Reed--Solomon decoders, we achieve significant complexity reductions.
One of the central tasks in quantum error-correction is to construct quantum codes that have good parameters. In this paper, we construct three new classes of quantum MDS codes from classical Hermitian self-orthogonal generalized Reed-Solomon codes. We also present some classes of quantum codes from matrix-product codes. It turns out that many of our quantum codes are new in the sense that the parameters of quantum codes cannot be obtained from all previous constructions.
We study the problem of classifying deep holes of Reed-Solomon codes. We show that this problem is equivalent to the problem of classifying MDS extensions of Reed-Solomon codes by one digit. This equivalence allows us to improve recent results on the former problem. In particular, we classify deep holes of Reed-Solomon codes of dimension greater than half the alphabet size. We also give a complete classification of deep holes of Reed Solomon codes with redundancy three in all dimensions.
The root finding step of the Guruswami-Rudra list decoding algorithm for folded Reed-Solomon codes is considered. It is shown that a multivariate generalization of the Roth-Ruckenstein algorithm can be used to implement it. This leads to an improved bound on the size of the list produced by the decoder, as well as enables one to relax the constraints on the parameters of folded codes. Furthermore, the class of time-domain folded Reed-Solomon codes is introduced, which can be efficiently list decoded with the Guruswami-Rudra algorithm, and provides greater flexibility in parameter selection tha…
An iterated refinement procedure for the Guruswami--Sudan list decoding algorithm for Generalised Reed--Solomon codes based on Alekhnovich's module minimisation is proposed. The method is parametrisable and allows variants of the usual list decoding approach. In particular, finding the list of \emph{closest} codewords within an intermediate radius can be performed with improved average-case complexity while retaining the worst-case complexity.
Recently, codes in the sum-rank metric attracted attention due to several applications in e.g. multishot network coding, distributed storage and quantum-resistant cryptography. The sum-rank analogs of Reed-Solomon and Gabidulin codes are linearized Reed-Solomon codes. We show how to construct $h$-folded linearized Reed-Solomon (FLRS) codes and derive an interpolation-based decoding scheme that is capable of correcting sum-rank errors beyond the unique decoding radius. The presented decoder can be used for either list or probabilistic unique decoding and requires at most $\mathcal{O}(sn^2)$ ope…
In this paper, we study a class of twisted generalized Reed-Solomon (TGRS) codes with general l twists. A sufficient and necessary condition for the TGRS codes to be MDS or l-MDS (l<k and l<n-k) is determined. A sufficient and necessary condition that such a TGRS code is self-dual for 3l<k-1 is also presented. Finally, we give an explicit construction of self-dual TGRS codes. And examples of self-dual MDS TGRS codes for small l are given.
We introduce Reed-Solomon-Gabidulin codes which is, at the same time, an extension to Reed-Solomon codes on the one hand and Gabidulin codes on the other hand. We prove that our codes have good properties with respect to the minimal distance and design an efficient decoding algorithm.
Quantum convolutional codes can be used to protect a sequence of qubits of arbitrary length against decoherence. In this paper, we give two new constructions of quantum MDS convolutional codes derived from generalized Reed-Solomon codes and obtain eighteen new classes of quantum MDS convolutional codes. Most of them are new in the sense that the parameters of the codes are different from all the previously known ones.
In this paper, we give a parity check matrix for the $(+)$-extended twisted generalized Reed Solomon (in short, ETGRS) code, and then not only prove that it is MDS or NMDS, but also determine the weight distribution. Especially, based on Schur method, we show that the $(+)$-ETGRS code is not GRS or EGRS. Furthermore, we present a sufficient and necessary condition for any punctured code of the $(+)$-ETGRS code to be self-orthogonal, and then construct several classes of self-dual $(+)$-TGRS codes and almost self-dual $(+)$-ETGRS codes.
We study Reed--Solomon codes over arbitrary fields, inspired by several recent papers dealing with Gabidulin codes over fields of characteristic zero. Over the field of rational numbers, we derive bounds on the coefficient growth during encoding and the bit complexity of decoding, which is polynomial in the code length and in the bit width of error and codeword values. The results can be generalized to arbitrary number fields.
A Decoding Algorithm for Composite Errors Consisting of Deletions and Insertions in Quantum Deletion-Correcting Codes Based on Quantum Reed-Solomon Codes
In this paper, we characterize the decoding region of algebraic soft decoding (ASD) of Reed-Solomon (RS) codes over erasure channels and binary symmetric channel (BSC). Optimal multiplicity assignment strategies (MAS) are investigated and tight bounds are derived to show the ASD can significantly outperform conventional Berlekamp Massey (BM) decoding over these channels for a wide code rate range. The analysis technique can also be extended to other channel models, e.g., RS coded modulation over erasure channels.
Network transfer and disk read are the most time consuming operations in the repair process for node failures in erasure-code-based distributed storage systems. Recent developments on Reed-Solomon codes, the most widely used erasure codes in practical storage systems, have shown that efficient repair schemes specifically tailored to these codes can significantly reduce the network bandwidth spent to recover single failures. However, the I/O cost, that is, the number of disk reads performed in these repair schemes remains largely unknown. We take the first step to address this gap in the litera…
In 2017, Beelen et al. firstly introduced twisted generalized Reed-Solomon (in short, TGRS) codes, and constructed a large subclass of MDS TGRS codes. Later, they proved that TGRS code is non-GRS when the code rate is less than one half. In this letter, basing on the dual code of the TGRS code or the extended TGRS code, by using the Schur product, we prove that almost all of TGRS codes and extended TGRS codes are non-GRS when the code rate more than one half.
