activity
20172026
most citedRank-metric codes over arbitrary Galois extensions and rank analogues of Reed-Muller codes

13 citations · 19 across the 4 of their papers we have counts for

collaborators

10 papers

cs.IT2026

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…

cs.IT2026

Locality for Codes over the Integers

Giulia Cavicchioni, Eleonora Guerrini, Julien Lavauzelle

In this work, we study the codes over the integers with locality constraints. We introduce a weighted notion of locality over $\mathbb{Z}/q_1\mathbb{Z} \times \cdots \times \mathbb…

cs.IT2020★ 13 cited

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…

cs.CR2020

On the privacy of a code-based single-server computational PIR scheme

Sarah Bordage, Julien Lavauzelle

We show that the single-server computational PIR protocol proposed by Holzbaur, Hollanti and Wachter-Zeh in 2020 is not private, in the sense that the server can recover in polynom…

cs.CR2019★ 6 cited

RAMESSES, a Rank Metric Encryption Scheme with Short Keys

Julien Lavauzelle, Pierre Loidreau, Ba-Duc Pham

We present a rank metric code-based encryption scheme with key and ciphertext sizes comparable to that of isogeny-based cryptography for an equivalent security level. The system al…

cs.IT2019

Weighted Lifted Codes: Local Correctabilities and Application to Robust Private Information Retrieval

Julien Lavauzelle, Jade Nardi

Low degree Reed-Muller codes are known to satisfy local decoding properties which find applications in private information retrieval (PIR) protocols, for instance. However, their p…