1 citations · 1 across the 5 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2025
On the Independence Assumption in Quasi-Cyclic Code-Based Cryptography
Maxime Bombar, Nicolas Resch, Emiel Wiedijk
Cryptography based on the presumed hardness of decoding codes -- i.e., code-based cryptography -- has recently seen increased interest due to its plausible security against quantum…
cs.IT2021★ 1 cited
Right-hand side decoding of Gabidulin code and applications
Maxime Bombar, Alain Couvreur
We discuss the decoding of Gabidulin and interleaved Gabidulin codes. We give the full presentation of a decoding algorithm for Gabidulin codes, which as Loidreau's seminal algorit…
cs.IT2018
Delocalisation of one-dimensional marginals of product measures and the capacity of LTI discrete channels
Maxime Bombar, Alexander Fish
We consider discrete linear time invariant (LTI) channels satisfying the phase independence (PI) assumption. We show that under the PI assumption the capacity of LTI channels is po…