| Publication | Date of Publication | Type |
|---|
| List-recovery of random linear codes over small fields | 2026-09-11 | Paper |
| Sharp threshold rates for random codes | 2026-04-15 | Paper |
The Fiat-Shamir transformation of (_1,,_ )-special-sound interactive proofs
Journal of Cryptology | 2026-04-10 | Paper |
List-recovery of random linear codes over small fields
IEEE Transactions on Information Theory | 2026-03-18 | Paper |
| Blaze: fast SNARKs from interleaved RAA codes | 2025-12-02 | Paper |
| LDPC codes achieve list decoding capacity | 2025-08-12 | Paper |
| Worst and average case hardness of decoding via smoothing bounds | 2025-07-29 | Paper |
Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
| Two-round perfectly secure message transmission with optimal transmission rate | 2024-11-22 | Paper |
| Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery | 2024-11-14 | Paper |
| Generalized special-sound interactive proofs and their knowledge soundness | 2024-08-02 | Paper |
Threshold rates of code ensembles: linear is best
IEEE Transactions on Information Theory | 2024-07-23 | Paper |
Smoothing codes and lattices: systematic study and new bounds
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
| Threshold rates of code ensembles: linear is best | 2024-06-24 | Paper |
| Interactive coding with small memory | 2024-05-14 | Paper |
Oblivious transfer with constant computational overhead
Advances in Cryptology – EUROCRYPT 2023 | 2024-01-16 | Paper |
Circuits resilient to short-circuit errors
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| scientific article; zbMATH DE number 7758311 (Why is no real title available?) | 2023-10-31 | Paper |
| Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes | 2023-09-04 | Paper |
Correlated pseudorandomness from expand-accumulate codes
Advances in Cryptology – CRYPTO 2022 | 2023-06-28 | Paper |
| scientific article; zbMATH DE number 7650135 (Why is no real title available?) | 2023-02-03 | Paper |
| Zero-Rate Thresholds and New Capacity Bounds for List-Decoding and List-Recovery | 2022-10-14 | Paper |
Bounds for List-Decoding and List-Recovery of Random Linear Codes
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Threshold Rates for Properties of Random Codes
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
Low-density parity-check codes achieve list-decoding capacity
SIAM Journal on Computing | 2022-01-07 | Paper |
Lossless dimension expanders via linearized polynomials and subspace designs
Combinatorica | 2021-10-25 | Paper |
On List Recovery of High-Rate Tensor Codes
IEEE Transactions on Information Theory | 2021-02-22 | Paper |
| scientific article; zbMATH DE number 7250144 (Why is no real title available?) | 2020-09-22 | Paper |
Sharp threshold rates for random codes
(available as arXiv preprint) | 2020-09-09 | Paper |
