Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 19
Number of items: 19
  • Open Access
    Mosheiff, J., Resch, N., Shang, K., & Yuan, C. (2025). Randomness-Efficient Constructions of Capacity-Achieving List-Decodable Codes. In 2025 IEEE International Symposium on Information Theory (ISIT 2025): Ann Arbor, Michigan, USA, 22-27 June 2025 (pp. 240-245). IEEE. https://doi.org/10.1109/ISIT63088.2025.11195274
  • Open Access
    Resch, N., Yuan, C., & Zhang, Y. (2025). Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes. In R. Meka (Ed.), 16th Innovations in Theoretical Computer Science Conference: ITCS 2025, January 7-10, 2025, Columbia University, New York, NY, USA Article 82 (Leibniz International Proceedings in Informatics; Vol. 325). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2025.82, https://doi.org/10.48550/arXiv.2309.01800
  • Open Access
    Bombar, M., Resch, N., & Wiedijk, E. (2025). On the Independence Assumption in Quasi-Cyclic Code-Based Cryptography. In 2025 IEEE International Symposium on Information Theory (ISIT 2025): Ann Arbor, Michigan, USA, 22-27 June 2025 (pp. 294-299). IEEE. https://doi.org/10.1109/ISIT63088.2025.11195347
  • Open Access
    Debris-Alazard, T., & Resch, N. (2025). Worst and Average Case Hardness of Decoding via Smoothing Bounds. In T. Jager, & J. Pan (Eds.), Public-Key Cryptography – PKC 2025: 28th IACR International Conference on Practice and Theory of Public-Key Cryptography, Røros, Norway, May 12–15, 2025 : proceedings (Vol. II, pp. 363-392). (Lecture Notes in Computer Science; Vol. 15675). Springer. https://doi.org/10.1007/978-3-031-91823-0_12
  • Open Access
    Brehm, M., Chen, B., Fisch, B., Resch, N., Rothblum, R. D., & Zeilberger, H. (2025). Blaze: Fast SNARKs from Interleaved RAA Codes. In S. Fehr, & P.-A. Fouque (Eds.), Advances in Cryptology – EUROCRYPT 2025: 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Madrid, Spain, May 4–8, 2025 : proceedings (Vol. IV, pp. 123-152). (Lecture Notes in Computer Science; Vol. 15604). Springer. https://doi.org/10.1007/978-3-031-91134-7_5
  • Open Access
    Doron, D., Mosheiff, J., Resch, N., & Ribeiro, J. (2025). List-Recovery of Random Linear Codes Over Small Fields. IEEE Transactions on Information Theory, 71(12), 9548-9562. https://doi.org/10.1109/TIT.2025.3625861
  • Open Access
    Doron, D., Mosheiff, J., Resch, N., & Ribeiro, J. (2025). List-Recovery of Random Linear Codes over Small Fields. In A. Ene, & E. Chattopadhyay (Eds.), Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques: APPROX/RANDOM 2025, August 11-13, 2025, Berkeley, CA, USA Article 57 (Leibniz International Proceedings in Informatics; Vol. 353). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2025.57, https://doi.org/10.48550/arXiv.2505.05935
  • 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
Page 1 of 2