• Corpus ID: 245704696

Fast Decoding of Interleaved Linearized Reed-Solomon Codes and Variants

@article{Bartz2022FastDO,
  title={Fast Decoding of Interleaved Linearized Reed-Solomon Codes and Variants},
  author={Hannes Bartz and Sven Puchinger},
  journal={ArXiv},
  year={2022},
  volume={abs/2201.01339}
}
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 $t\leq\frac{s}{s+1}(n-k)$, where s is the interleaving order, n the length and k the dimension of the code. Upper… 

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.

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

This work proposes 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 Berlekamp-Massey-like decoder.

Fast Kötter-Nielsen-Høholdt Interpolation over Skew Polynomial Rings

A fast divide-and-conquer variant of K¨otter–Nielsen–Høholdt (KNH) interpolation algorithm that inputs a list of linear functionals on skew polynomial vectors, and outputs a reduced Gr¨obner basis of their kernel intersection and matches the previous best speeds for these tasks.