1,559 research outputs found
Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
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 skew
Reed-Solomon codes have maximum skew distance, and then we translate this
scenario to linearized Reed-Solomon codes and the sum-rank metric. The theories
of Reed-Solomon codes and Gabidulin codes are particular cases of our theory,
and the sum-rank metric extends both the Hamming and rank metrics. We develop
our theory over any division ring (commutative or non-commutative field). We
also consider non-zero derivations, which give new maximum rank distance codes
over infinite fields not considered before
Interpolation-Based Decoding of Folded Variants of Linearized and Skew Reed-Solomon Codes
The sum-rank metric is a hybrid between the Hamming metric and the rank
metric and suitable for error correction in multishot network coding and
distributed storage as well as for the design of quantum-resistant
cryptosystems. In this work, we consider the construction and decoding of
folded linearized Reed-Solomon (FLRS) codes, which are shown to be maximum
sum-rank distance (MSRD) for appropriate parameter choices. We derive an
efficient interpolation-based decoding algorithm for FLRS codes that can be
used as a list decoder or as a probabilistic unique decoder. The proposed
decoding scheme can correct sum-rank errors beyond the unique decoding radius
with a computational complexity that is quadratic in the length of the unfolded
code. We show how the error-correction capability can be optimized for
high-rate codes by an alternative choice of interpolation points. We derive a
heuristic upper bound on the decoding failure probability of the probabilistic
unique decoder and verify its tightness by Monte Carlo simulations. Further, we
study the construction and decoding of folded skew Reed-Solomon codes in the
skew metric. Up to our knowledge, FLRS codes are the first MSRD codes with
different block sizes that come along with an efficient decoding algorithm.Comment: 32 pages, 3 figures, accepted at Designs, Codes and Cryptograph
Fast Decoding of Interleaved Linearized Reed-Solomon Codes and Variants
We construct s-interleaved linearized Reed-Solomon (ILRS) codes and variants
and propose efficient decoding schemes that can correct errors beyond the
unique decoding radius in the sum-rank, sum-subspace and skew metric. The
proposed interpolation-based scheme for ILRS codes can be used as a list
decoder or as a probabilistic unique decoder that corrects errors of sum-rank
up to , where s is the interleaving order, n the
length and k the dimension of the code. Upper bounds on the list size and the
decoding failure probability are given where the latter is based on a novel
Loidreau-Overbeck-like decoder for ILRS codes. The results are extended to
decoding of lifted interleaved linearized Reed-Solomon (LILRS) codes in the
sum-subspace metric and interleaved skew Reed-Solomon (ISRS) codes in the skew
metric. We generalize fast minimal approximant basis interpolation techniques
to obtain efficient decoding schemes for ILRS codes (and variants) with
subquadratic complexity in the code length. Up to our knowledge, the presented
decoding schemes are the first being able to correct errors beyond the unique
decoding region in the sum-rank, sum-subspace and skew metric. The results for
the proposed decoding schemes are validated via Monte Carlo simulations.Comment: submitted to IEEE Transactions on Information Theory, 57 pages, 10
figure
- …