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β€s+1sβ(nβk), 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