44 citations · 182 across the 32 of their papers we have counts for
7 papers · 1 filter
Three Combinatorial Perspectives on Minimal Codes
Gianira N. Alfarano, Martino Borello, Alessandro Neri +1
We develop three approaches of combinatorial flavour to study the structure of minimal codes and cutting blocking sets in finite geometry, each of which has a particular applicatio…
Weighted Reed-Solomon convolutional codes
Gianira N. Alfarano, Diego Napp, Alessandro Neri +1
In this paper we present a concrete algebraic construction of a novel class of convolutional codes. These codes are built upon generalized Vandermonde matrices and therefore can be…
Decoding of Interleaved Alternant Codes
Lukas Holzbaur, Hedongliang Liu, Alessandro Neri +4
Interleaved Reed-Solomon codes admit efficient decoding algorithms which correct burst errors far beyond half the minimum distance in the random errors regime, e.g., by computing a…
Constructing Partial MDS Codes from Reducible Curves
Tristram Bogart, Anna-Lena Horlemann-Trautmann, David Karpuk +2
We propose reducible algebraic curves as a mechanism to construct Partial MDS (PMDS) codes geometrically. We obtain new general existence results, new explicit constructions and im…
Rank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes
Daniel Augot, Alain Couvreur, Julien Lavauzelle +1
This paper extends the study of rank-metric codes in extension fields equipped with an arbitrary Galois group . We propose a f…
Low-Rank Parity-Check Codes over Galois Rings
Julian Renner, Alessandro Neri, Sven Puchinger
Low-rank parity-check (LRPC) are rank-metric codes over finite fields, which have been proposed by Gaborit et al. (2013) for cryptographic applications. Inspired by a recent adapti…