Martínez-Peñas and Kschischang (IEEE Trans. Inf. Theory, 2019)
proposed ...
Mixed codes, which are error-correcting codes in the Cartesian product o...
The rank metric measures the distance between two matrices by the rank o...
This paper considers coding for so-called partially stuck (defect) memor...
Codes in the sum-rank metric have various applications in error control ...
This paper is concerned with list decoding of 2-interleaved binary
alter...
We construct s-interleaved linearized Reed-Solomon (ILRS) codes and vari...
Cryptographic algorithms rely on the secrecy of their corresponding keys...
Lifted codes are a class of evaluation codes attracting more attention d...
In this work, maximum sum-rank distance (MSRD) codes and linearized
Reed...
In this article, we present a new construction of evaluation codes in th...
Power decoding is a partial decoding paradigm for arbitrary algebraic
ge...
Linearized Reed-Solomon (LRS) codes are sum-rank metric codes that fulfi...
We derive simplified sphere-packing and Gilbert-Varshamov bounds for cod...
This paper presents the first decoding algorithm for Gabidulin codes ove...
Locality enables storage systems to recover failed nodes from small subs...
Recently, Martinez-Penas and Kschischang (IEEE Trans. Inf. Theory, 2019)...
Interleaved Reed-Solomon codes admit efficient decoding algorithms which...
The Learning with Errors (LWE) problem is an 𝒩𝒫-hard problem that
lies t...
Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure
cor...
This paper considers coding for so-called partially stuck memory cells. ...
Low-rank parity-check (LRPC) are rank-metric codes over finite fields, w...
We speed up existing decoding algorithms for three code classes in diffe...
In this paper, we study achievable rates of concatenated coding schemes ...
We propose the first non-trivial generic decoding algorithm for codes in...
We define and analyze low-rank parity-check (LRPC) codes over extension ...
Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure cod...
We study scalar-linear and vector-linear solutions to the generalized
co...
We address the problem of decoding Gabidulin codes beyond their
error-co...
We show that the sequence of dimensions of the linear spaces, generated ...
We present code constructions for masking u partially stuck memory cells...
In this work it is shown that locally repairable codes (LRCs) can be
lis...
We show that the sequence of dimensions of the linear spaces, generated ...
This paper presents an algorithm for decoding homogeneous interleaved co...
We consider error decoding of locally repairable codes (LRC) and partial...
We propose and analyze an interleaved variant of Loidreau's rank-metric
...
Goppa Codes are a well-known class of codes with, among others, applicat...
We study Reed-Solomon codes over arbitrary fields, inspired by several r...
A repair of the Faure-Loidreau (FL) public-key code-based cryptosystem i...
In this paper, we investigate twisted Gabidulin codes in the GPT code-ba...
We propose a new partial decoding algorithm for h-interleaved one-point
...
We present a generalisation of Twisted Reed-Solomon codes containing a n...
A repair of the Faure-Loidreau (FL) public-key code-based cryptosystem i...
We prove that Alekhnovich's algorithm can be used for row reduction of s...
We present a new approach on low-rank matrix recovery (LRMR) based on
Ga...
This paper considers fast algorithms for operations on linearized
polyno...