15 citations · 26 across the 10 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.IT2022
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery
Nicolas Resch, Chen Yuan, Yihan Zhang
In this work we consider the list-decodability and list-recoverability of arbitrary -ary codes, for all integer values of . A code is called -list-decodable if…
cs.IT2022
Threshold Rates of Codes Ensembles: Linear is Best
Nicolas Resch, Chen Yuan
In this work, we prove new results concerning the combinatorial properties of random linear codes. Firstly, we prove a lower bound on the list-size required for random linear codes…
cs.IT2022★ 1 cited
Smoothing Codes and Lattices: Systematic Study and New Bounds
Thomas Debris-Alazard, Léo Ducas, Nicolas Resch +1
In this article we revisit smoothing bounds in parallel between lattices codes. Initially introduced by Micciancio and Regev, these bounds were instantiated with Gaussian dis…