Nicolas Resch

Publication Activity (10 Years)

Years Active: 2017-2024
Publications (10 Years): 41

Top Topics

Error Correction

Message Transmission

Top Venues

IACR Cryptol. ePrint Arch.

IEEE Trans. Inf. Theory

Electron. Colloquium Comput. Complex.

Publications

Nicolas Resch, Chen Yuan
Threshold Rates of Code Ensembles: Linear Is Best. IEEE Trans. Inf. Theory 70 (7) (2024)
Jonathan Mosheiff, Nicolas Resch, Kuo Shang, Chen Yuan
Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes. CoRR (2024)
Thomas Attema, Serge Fehr, Nicolas Resch
A Generalized Special-Soundness Notion and its Knowledge Extractors. IACR Cryptol. ePrint Arch. 2023 (2023)
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl
Oblivious Transfer with Constant Computational Overhead. IACR Cryptol. ePrint Arch. 2023 (2023)
Nicolas Resch, Chen Yuan
Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate. ITC (2023)
Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena
Interactive Coding with Small Memory. SODA (2023)
Nicolas Resch, Chen Yuan, Yihan Zhang
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. ICALP (2023)
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl
Oblivious Transfer with Constant Computational Overhead. EUROCRYPT (1) (2023)
Thomas Attema, Serge Fehr, Michael Klooß, Nicolas Resch
-Special-Sound Interactive Proofs. IACR Cryptol. ePrint Arch. 2023 (2023)
Nicolas Resch, Chen Yuan, Yihan Zhang
Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes. CoRR (2023)
Thomas Attema, Serge Fehr, Nicolas Resch
Generalized Special-Sound Interactive Proofs and Their Knowledge Soundness. TCC (3) (2023)
Thomas Debris-Alazard, Léo Ducas, Nicolas Resch, Jean-Pierre Tillich
Smoothing Codes and Lattices: Systematic Study and New Bounds. IEEE Trans. Inf. Theory 69 (9) (2023)
Venkatesan Guruswami, Jonathan Moshieff, Nicolas Resch, Shashwat Silas, Mary Wootters
Threshold Rates for Properties of Random Codes. IEEE Trans. Inf. Theory 68 (2) (2022)
Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters
Bounds for List-Decoding and List-Recovery of Random Linear Codes. IEEE Trans. Inf. Theory 68 (2) (2022)
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl
Correlated Pseudorandomness from Expand-Accumulate Codes. IACR Cryptol. ePrint Arch. 2022 (2022)
Elette Boyle, Geoffroy Couteau, Niv Gilboa, Yuval Ishai, Lisa Kohl, Nicolas Resch, Peter Scholl
Correlated Pseudorandomness from Expand-Accumulate Codes. CRYPTO (2) (2022)
Thomas Debris-Alazard, Léo Ducas, Nicolas Resch, Jean-Pierre Tillich
Smoothing Codes and Lattices: Systematic Study and New Bounds. IACR Cryptol. ePrint Arch. 2022 (2022)
Thomas Debris-Alazard, Nicolas Resch
Worst and Average Case Hardness of Decoding via Smoothing Bounds. IACR Cryptol. ePrint Arch. 2022 (2022)
Klim Efremenko, Bernhard Haeupler, Yael Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh Saxena
Circuits Resilient to Short-Circuit Errors. Electron. Colloquium Comput. Complex. (2022)
Thomas Debris-Alazard, Léo Ducas, Nicolas Resch, Jean-Pierre Tillich
Smoothing Codes and Lattices: Systematic Study and New Bounds. CoRR (2022)
Nicolas Resch, Chen Yuan, Yihan Zhang
Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. CoRR (2022)
Klim Efremenko, Bernhard Haeupler, Gillat Kol, Nicolas Resch, Raghuvansh Saxena, Yael Tauman Kalai
Interactive Coding with Small Memory. Electron. Colloquium Comput. Complex. (2022)
Klim Efremenko, Bernhard Haeupler, Yael Tauman Kalai, Pritish Kamath, Gillat Kol, Nicolas Resch, Raghuvansh R. Saxena
Circuits resilient to short-circuit errors. STOC (2022)
Nicolas Resch, Chen Yuan
Threshold Rates of Codes Ensembles: Linear is Best. CoRR (2022)
Nicolas Resch, Chen Yuan
Threshold Rates of Code Ensembles: Linear Is Best. ICALP (2022)
Venkatesan Guruswami, Nicolas Resch, Chaoping Xing
Lossless Dimension Expanders Via Linearized Polynomials and Subspace Designs. Comb. 41 (4) (2021)
Nicolas Resch, Chen Yuan
Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate. IACR Cryptol. ePrint Arch. 2021 (2021)
Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas
On List Recovery of High-Rate Tensor Codes. IEEE Trans. Inf. Theory 67 (1) (2021)
Venkatesan Guruswami, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters
Sharp Threshold Rates for Random Codes. ITCS (2021)
Venkatesan Guruswami, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters
Sharp threshold rates for random codes. CoRR (2020)
Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters
LDPC Codes Achieve List Decoding Capacity. FOCS (2020)
Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters
Bounds for list-decoding and list-recovery of random linear codes. CoRR (2020)
Venkatesan Guruswami, Ray Li, Jonathan Mosheiff, Nicolas Resch, Shashwat Silas, Mary Wootters
Bounds for List-Decoding and List-Recovery of Random Linear Codes. APPROX-RANDOM (2020)
Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters
LDPC Codes Achieve List-Decoding Capacity. Electron. Colloquium Comput. Complex. 26 (2019)
Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas
On List Recovery of High-Rate Tensor Codes. Electron. Colloquium Comput. Complex. 26 (2019)
Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, Mary Wootters
LDPC Codes Achieve List Decoding Capacity. CoRR (2019)
Swastik Kopparty, Nicolas Resch, Noga Ron-Zewi, Shubhangi Saraf, Shashwat Silas
On List Recovery of High-Rate Tensor Codes. APPROX-RANDOM (2019)
Venkatesan Guruswami, Nicolas Resch, Chaoping Xing
Lossless Dimension Expanders via Linearized Polynomials and Subspace Designs. Computational Complexity Conference (2018)
Venkatesan Guruswami, Nicolas Resch, Chaoping Xing
Lossless dimension expanders via linearized polynomials and subspace designs. Electron. Colloquium Comput. Complex. 25 (2018)
Venkatesan Guruswami, Nicolas Resch
On the List-Decodability of Random Linear Rank-Metric Codes. ISIT (2018)
Venkatesan Guruswami, Nicolas Resch
On the List-Decodability of Random Linear Rank-Metric Codes. CoRR (2017)