Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 22
Number of items: 22
  • Mosheiff, J., Resch, N., Ron-Zewi, N., Silas, S., & Wootters, M. (2024). Low-Density Parity-Check Codes Achieve List-Decoding Capacity. SIAM Journal on Computing, 53(6), FOCS20-38-FOCS20-73. https://doi.org/10.1137/20M1365934
  • Open Access
    Resch, N., & Yuan, C. (2024). Threshold Rates of Code Ensembles: Linear Is Best. IEEE Transactions on Information Theory, 70(7), 4823-4842. https://doi.org/10.1109/TIT.2024.3357703
  • Open Access
    Resch, N., Yuan, C., & Zhang, Y. (2024). Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. IEEE Transactions on Information Theory, 70(9), 6211-6238. https://doi.org/10.1109/TIT.2024.3430842
  • Efremenko, K., Haeupler, B., Kalai, Y. T., Kol, G., Resch, N., & Saxena, R. R. (2023). Interactive Coding with Small Memory. In N. Bansal, & V. Nagarajan (Eds.), Proceedings of the Thirty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2023) (pp. 3587-3613). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977554.ch137
  • Attema, T., Fehr, S., & Resch, N. (2023). Generalized Special-Sound Interactive Proofs and Their Knowledge Soundness. In G. Rothblum, & H. Wee (Eds.), Theory of Cryptography: 21st International Conference, TCC 2023, Taipei, Taiwan, November 29–December 2, 2023 : proceedings (Vol. III, pp. 424-454). (Lecture Notes in Computer Science; Vol. 14371). Springer. https://doi.org/10.1007/978-3-031-48621-0_15
  • Debris-Alazard, T., Ducas, L., Resch, N., & Tillich, J.-P. (2023). Smoothing Codes and Lattices: Systematic Study and New Bounds. IEEE Transactions on Information Theory, 69(9), 6006-6027. https://doi.org/10.1109/TIT.2023.3276921
  • Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Resch, N., & Scholl, P. (2023). Oblivious Transfer with Constant Computational Overhead. In C. Hazay, & M. Stam (Eds.), Advances in Cryptology – EUROCRYPT 2023: 42nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Lyon, France, April 23-27, 2023 : proceedings (Vol. I, pp. 271-302). (Lecture Notes in Computer Science; Vol. 14004). Springer. https://doi.org/10.1007/978-3-031-30545-0_10
  • Open Access
    Resch, N., & Yuan, C. (2023). Two-Round Perfectly Secure Message Transmission with Optimal Transmission Rate. In K.-M. Chung (Ed.), 4th Conference on Information-Theoretic Cryptography: ITC 2023, June 6–8, 2023, Aarhus University, Aarhus, Denmark Article 1 (Leibniz International Proceedings in Informatics; Vol. 267). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITC.2023.1
  • Open Access
    Resch, N., Yuan, C., & Zhang, Y. (2023). Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery. In K. Etessami, U. Feige, & G. Puppis (Eds.), 50th International Colloquium on Automata, Languages, and Programming: ICALP 2023, July 10-14, 2023, Paderborn, Germany Article 99 (Leibniz International Proceedings in Informatics; Vol. 261). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.99
  • Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Resch, N., & Scholl, P. (2022). Correlated Pseudorandomness from Expand-Accumulate Codes. In Y. Dodis, & T. Shrimpton (Eds.), Advances in Cryptology – CRYPTO 2022: 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15–18, 2022 : proceedings (pp. 603-633). (Lecture Notes in Computer Science; Vol. 13508). Springer. https://doi.org/10.1007/978-3-031-15979-4_21
Page 2 of 3