51�� Information Theory Society

Department of ECE and Institute for Systems Research

University of Maryland

College Park, MD 20742

Urbashi Mitra is the winner of the 2024 Aaron D. Wyner Distinguished Service Award

Paper award 38489

2024

Minimum Feedback for Collision-Free Scheduling in Massive Random Access

51�� Trans. Inf. Theory

December 2021

Person Award 38488

2024

Urbashi

Mitra

Gordon Marshall Chair in Engineering

University of Southern California

Paper award 38487

2024

Optimal Redundancy in Exact Channel Synthesis

Proceedings of the 2024 51�� International Symposium on Information Theory

July 2024

Paper award 38486

2024

An Entropic Inequality in Finite Abelian Groups Analogous to the Unified Brascamp-Lieb and Entropy Power Inequality

Proceedings of the 2024 51�� International Symposium on Information Theory

July 2024

Paper award 38485

2024

MSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper Nodes

Proceedings of the 2024 51�� International Symposium on Information Theory

July 2024

Paper award 38479

2024

Asymptotically Good Quantum and Locally Testable Classical LDPC Codes

Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC2022)

June 2022

Person Award 38481

2025

Peter

Shor

Henry Adams Morss and Henry Adams Morss, Jr. Professor of Applied Math

Massachusetts Institute of Technology

Paper award 38480

2024

Locally Testable Codes with Constant Rate, Distance, and Locality

Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (STOC2022)

June 2022

51��

Committee members 38492

Urbashi Mitra is the winner of the 2024 Aaron D. Wyner Distinguished Service Award

Paper award 38489

Minimum Feedback for Collision-Free Scheduling in Massive Random Access

Person Award 38488

Paper award 38487

Optimal Redundancy in Exact Channel Synthesis

Paper award 38486

An Entropic Inequality in Finite Abelian Groups Analogous to the Unified Brascamp-Lieb and Entropy Power Inequality

Paper award 38485

MSR Codes with Linear Field Size and Smallest Sub-packetization for Any Number of Helper Nodes

Paper award 38479

Asymptotically Good Quantum and Locally Testable Classical LDPC Codes

Person Award 38481

Paper award 38480

Locally Testable Codes with Constant Rate, Distance, and Locality

Subscribe to Our Mailing List