1 citations · 2 across the 5 of their papers we have counts for
4 papers · 1 filter
New perspectives for code locality in the rank metric
Camille Garnier, Julien Lavauzelle, Jade Nardi +1
In coding theory, local recovery enables the efficient recovery of some part of (lost) coded data by accessing only a small number of other data entries. Locality was mostly but in…
On the structure of the Schur squares of Twisted Generalized Reed-Solomon codes and application to cryptanalysis
Alain Couvreur, Rakhi Pratihar, Nihan Tanısalı +1
Twisted generalized Reed-Solomon (TGRS) codes constitute an interesting family of evaluation codes, containing a large class of maximum distance separable codes non-equivalent to g…
Enhancing simultaneous rational function recovery: adaptive error correction capability and new bounds for applications
Eleonora Guerrini, Romain Lebreton, Ilaria Zappatore
In this work we present some results that allow to improve the decoding radius in solving polynomial linear systems with errors in the scenario where errors are additive and random…
Polynomial Linear System Solving with Errors by Simultaneous Polynomial Reconstruction of Interleaved Reed-Solomon Codes
E. Guerrini, R. Lebreton, I. Zappatore
In this paper we present a new algorithm for Polynomial Linear System Solving (via evaluation/interpolation) with errors. In this scenario, errors can occur in the black box evalua…