Error-Erasure Decoding of Linearized Reed-Solomon Codes in the Sum-Rank Metric

  title={Error-Erasure Decoding of Linearized Reed-Solomon Codes in the Sum-Rank Metric},
  author={Felicitas H{\"o}rmann and Hannes Bartz and Sven Puchinger},
  journal={2022 IEEE International Symposium on Information Theory (ISIT)},
Codes in the sum-rank metric have various applications in error control for multishot network coding, distributed storage and code-based cryptography. Linearized Reed-Solomon (LRS) codes contain Reed-Solomon and Gabidulin codes as subclasses and fulfill the Singleton-like bound in the sum-rank metric with equality. We propose the first known error-erasure decoder for LRS codes to unleash their full potential for multishot network coding by incorporating erasures into the known syndrome-based… 
2 Citations

Multilayer crisscross error and erasure correction

In this work, multilayer crisscross error and erasures are considered, which affect entire rows and columns in the matrices of a list of matrices, and the multi-cover metric is introduced.

Covering Properties of Sum-Rank Metric Codes

This work intends to answer the question: what is the minimum cardinality of a code given a sum-rank covering radius, and shows the relations of this quantity between different metrics and provides several lower and upper bounds for sum-Rank metric codes.



Efficient Decoding of Folded Linearized Reed-Solomon Codes in the Sum-Rank Metric

This work shows 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 and derives a heuristic upper bound on the failure probability of the probabilistic unique decoder.

Fast Decoding of Interleaved Linearized Reed-Solomon Codes and Variants

Fast minimal approximant basis interpolation techniques are generalized to obtain efficient decoding schemes for ILRS codes (and variants) with subquadratic complexity in the code length to be the first being able to correct errors beyond the unique decoding region in the sum-rank, sum-subspace and skew metric.

Decoding of Interleaved Linearized Reed-Solomon Codes with Applications to Network Coding

  • H. BartzS. Puchinger
  • Computer Science
    2021 IEEE International Symposium on Information Theory (ISIT)
  • 2021
A heuristic argument and simulation results indicate that the list size is in fact one for most channel realizations up to the maximal decoding radius, and the best upper bound on the listsize is exponential.

Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring

Error and Erasure Decoding of Rank-Codes with a Modified Berlekamp-Massey Algorithm

A modified Berlekamp-Massey algorithm for the decoding of rank errors and extend it for row erasure and rank errors is introduced and a decoding algorithm for both row and column erasures andRank-Codes is investigated.

On transform-domain error and erasure correction by Gabidulin codes

This paper proposes a transform-domain algorithm correcting both errors and erasures with Gabidulin codes, and generalizes the proposed decoding algorithm for interleaved Gabdulin codes.

A Fast Matrix Decoding Algorithm for Rank-Error-Correcting Codes

A new construction of MRD codes is given and a new fast matrix decoding algorithm is proposed which generalizes Peterson's algorithm for BCH codes.

A Rank-Metric Approach to Error Control in Random Network Coding

The problem of error control in random linear network coding is addressed from a matrix perspective that is closely related to the subspace perspective of Rotter and Kschischang and an efficient decoding algorithm is proposed that can properly exploit erasures and deviations.

Convolutional Codes in Rank Metric With Application to Random Network Coding

This paper considers a noncoherent multishot network, where the unknown and time-variant network is used several times and particular convolutional codes in rank metric are used in order to create dependence between the different shots.

Error and erasure correcting algorithms for rank codes

In this paper, transmitted signals are considered as square matrices of the Maximum rank distance (MRD) (n, k, d)-codes. A new composed decoding algorithm is proposed to correct simultaneously rank