IEEE Information Theory Society Paper Award · 2015
Optimal local recovery
With Alexander Barg, I developed optimal locally recoverable codes that combine efficient repair with strong protection against data loss.
Associate Professor · Tel Aviv University
I develop mathematical constructions and algorithms for reliable information processing under limited resources. My work connects optimal data recovery with distributed computation, private data access, and quantum error correction.

IEEE Information Theory Society Paper Award · 2015
With Alexander Barg, I developed optimal locally recoverable codes that combine efficient repair with strong protection against data loss.
Recent research · 2026
Recent joint work develops coset-based quantum LDPC codes, compact check-measurement schedules, and codes supporting transversal non-Clifford gates.
ICML · USENIX ATC
Joint work introduces approximate gradient coding to reduce computation under stragglers. Collaborations also connect storage-repair tradeoffs with experimental system evaluations.
Make information more resilient, computation more efficient, and data access more private. My research connects fundamental questions with the systems they can transform.
Protecting quantum information. Enabling quantum computation.
Developing quantum codes and fault-tolerant logical operations that connect mathematical guarantees with the resources of a quantum computer: physical qubits, check measurements, and connectivity.
Recent collaborations introduce coset-based quantum LDPC constructions and codes with transversal non-Clifford gates. Current directions include physical layout constraints and the tradeoffs between error protection and logical operations.
Explore selected papersRetrieve the information. Keep the question private.
Understanding how to query distributed data without revealing which item is being requested. Graph-based models turn storage topology into a precise language for privacy and communication tradeoffs.
My work on private information retrieval over graphs studies the limits and protocols of replicated storage systems. These models expose how the pattern of data placement affects achievable retrieval rates and communication costs.
Explore selected papersLess waiting. Faster recovery. Smarter redundancy.
Designing ways to recover data and sustain computation while reducing the bandwidth, access, and redundancy they consume. Applications span distributed storage, straggler mitigation in learning, and emerging DNA storage systems.
My work studies local recovery, optimal repair of Reed–Solomon and MDS codes, approximate gradient coding, and access-efficient linear computation. The goal is to understand and improve the tradeoffs among reliability, communication, and computational cost.
Explore selected papersFind the limits. Build beyond what was possible.
Advancing error correction through explicit constructions, list decoding, and algebraic and combinatorial methods. Fundamental questions become new tools for reliable storage, computation, and quantum information.
Contributions include generalized Singleton bounds, Reed–Solomon list decoding beyond the Johnson radius, explicit capacity-achieving subcodes, and algebraic expander codes. These results develop techniques that connect information theory with theoretical computer science.
Explore selected papers8 of 15 selected publications
Preprint
Coset actions expand the construction space; compact check-measurement schedules and circuit-level simulations assess performance
IEEE Transactions on Information Theory
✧ Optimal local-recovery constructions · 2015 IEEE Information Theory Society Paper Award
Preprint
Quantum codes with constant-weight stabilizers and transversal non-Clifford logical gates
IEEE Transactions on Information Theory
✧ Optimal rebuilding for MDS array codes · 2013 Data Storage Technical Committee Best Paper Award
ICML 2018 · IEEE Transactions on Information Theory 2020
Approximate gradients trade controlled error for reduced computation under stragglers
USENIX ATC 2018 · ACM Transactions on Storage 2020
Joint theory and systems evaluation links repair costs with network and storage bottlenecks
SIAM Journal on Computing
New limits and constructions for list decoding
IEEE Transactions on Information Forensics and Security
Retrieval limits in graph-based storage
Preprint
Asymmetric protection and transversal operations
IEEE Transactions on Information Theory
Codes that reduce the expected number of reads needed to retrieve a data strand
IEEE Journal on Selected Areas in Information Theory
Polynomial constructions for quantum local recovery
IEEE Transactions on Information Theory
Explicit constructions with efficient list decoding
IEEE Transactions on Information Theory
Reducing data access for linear computation
IEEE Transactions on Information Theory
Private retrieval shaped by storage topology
No selected publications in this research area.
Algebraic Expander Codes
Presented at the Explicit Constructions workshop.
Watch talkAlgebraic Expander Codes
Computer Science/Discrete Mathematics Seminar II.
Watch talkDepartment of Electrical and Computer Engineering–Systems
Tel Aviv University
European Research Council
Israel Science Foundation
NSF–BSF
I am an Associate Professor in the Department of Electrical and Computer Engineering–Systems at Tel Aviv University and Head of the Advanced Communication Center. My research combines information theory, algorithms, algebra, and combinatorics to understand the limits of reliable information processing and to construct methods that approach them.
A recurring question in my work is how to obtain stronger protection with fewer resources: less communication during data repair, less computation when workers are slow, or fewer physical resources for quantum error correction and logical operations. This connects my established work on storage codes with my recent research in quantum fault tolerance.
European Research Council · Informational Properties of Networks
A Family of Optimal Locally Recoverable Codes
Wolf Foundation
IEEE Communications Society · Zigzag Codes
Tel Aviv University
Dean’s Teaching Award · Tel Aviv University · 2022
Graduate students I supervised and postdoctoral researchers I mentored.
Postdoctoral researcher · 2024–2025
Assistant Professor, Dhirubhai Ambani University
Postdoctoral researcher · 2023–2025
Technical University of Munich
Postdoctoral researcher · 2021–2025
Graduate student (Ph.D.) · 2019–2023
Senior Lecturer (Assistant Professor), Tel Aviv University
Graduate student (M.Sc.) · 2020–2022
Postdoctoral researcher · 2020–2022
Postdoctoral Researcher, University of Haifa
Graduate student (M.Sc.) · 2019–2021
Postdoctoral researcher · 2020
Associate Professor, Kyushu University
Graduate student (M.Sc.) · 2018–2020
Postdoctoral researcher · 2017–2020
Professor, Shandong University
Graduate student (M.Sc.) · 2017–2018
Graduate student (M.Sc.) · 2016–2018
Postdoctoral researcher · 2016–2017
Assistant Professor, Washington University in St. Louis
For research conversations and academic inquiries.
[email protected]Associate Professor · Tel Aviv University