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

Recently, Martínez-Peñas and Kschischang (IEEE Trans. Inf. Theory, 2019) showed that
lifted linearized Reed-Solomon codes are suitable codes for error control in multishot …

We propose a new partial decoding algorithm for m-interleaved Reed-Solomon (IRS) codes
that can decode, with high probability, a random error of relative weight 1-R m/m+ 1 at all …

Goppa Codes are a well-known class of codes with, among others, applications in code-
based cryptography. In this paper, we present a collaborative decoding algorithm for …

This dissertation considers constructions and decoders of several evaluation codes in
Hamming and rank metric. Codes in Hamming metric have been studied since the 1950s …

Martínez-Peñas and Kschischang (IEEE Trans. Inf. Theory 65 (8): 4785–4803, 2019)
proposed lifted linearized Reed–Solomon codes as suitable codes for error control in …

This paper presents an algorithm for decoding any linear interleaved code of high
interleaving order in the rank metric. The new decoder is an adaptation of the Hamming …

In this work it is shown that locally repairable codes (LRCs) can be list-decoded efficiently
beyond the Johnson radius for a large range of parameters by utilizing the local error …

Interleaved Reed–Solomon codes admit efficient decoding algorithms which correct burst
errors far beyond half the minimum distance in the random errors regime, eg, by computing …

This thesis studies code-based cryptography. First, three problems related to code-based
cryptography are investigated and algorithms to solve them are presented. Then, attacks on …