We construct $ s $-interleaved linearized Reed--Solomon (ILRS) codes and variants and
propose efficient decoding schemes that can correct errors beyond the unique decoding …

Linearized Reed-Solomon (LRS) codes are a class of evaluation codes based on skew
polynomials. They achieve the Singleton bound in the sum-rank metric, and therefore are …

The sum-rank metric can be seen as a generalization of both, the rank and the Hamming
metric. It is well known that sum-rank metric codes outperform rank metric codes in terms of …

The sum-rank metric generalizes the Hamming and rank metric by partitioning vectors into
blocks and defining the total weight as the sum of the rank weights of these blocks, based on …

Sum-rank metric codes are a natural extension of both linear block codes and rank-metric
codes. They have several applications in information theory, including multishot network …

Linearized Reed-Solomon (LRS) codes are evaluation codes based on skew polynomials.
They achieve the Singleton bound in the sum-rank metric and therefore are known as …

Linearized Reed--Solomon (LRS) codes are sum-rank-metric codes that generalize both
Reed--Solomon and Gabidulin codes. We study vertically and horizontally interleaved LRS …

Both horizontal interleaving as well as the sum-rank metric are currently attractive topics in
the field of code-based cryptography, as they could mitigate the problem of large key sizes …

The sum-rank metric arises as an algebraic approach for coding in MIMO block-fading
channels and multishot network coding. Codes designed in the sum-rank metric have raised …

This dissertation considers new constructions and decoding approaches for error-correcting
codes based on non-conventional polynomials, with the objective of providing new coding …