← back to search

Yury Polyanskiy

Vassar College · US
Area of research
Electrical and Electronic Engineering · Computer Networks and Communications
Research interest
Research interests include Wireless Communication Security Techniques, Cooperative Communication and Network Coding, Error Correcting Code Techniques, and Advanced Wireless Communication Techniques.
h-index
33
citations
9,246
works
253
NIH funding
primary concept
email

Recent publications

A mathematical perspective on transformers
Bulletin of the American Mathematical Society 2025cited by 11position: middledoi
Optimal Quantization for Matrix Multiplication
2025cited by 2position: lastdoi
Optimal Quantization for Matrix Multiplication
IEEE Transactions on Information Theory 2025cited by 0position: lastdoi
Information Theory
Cambridge University Press eBooks 2024cited by 63position: firstdoi
Unsourced Multiple Access: A Coding Paradigm for Massive Random Access
Proceedings of the IEEE 2024cited by 25position: lastdoi
Dynamic metastability in the self-attention model
arXiv (Cornell University) 2024cited by 2position: middledoi
Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles
2023cited by 1position: lastdoi
Comparing Poisson and Gaussian channels
2023cited by 0position: lastdoi
Capacity of Noisy Permutation Channels
2022 IEEE International Symposium on Information Theory (ISIT) 2022cited by 5position: lastdoi
Efficient Representation of Large-Alphabet Probability Distributions via Arcsinh-Compander
2022 IEEE International Symposium on Information Theory (ISIT) 2022cited by 0position: lastdoi
Fundamental Limits of Many-User MAC With Finite Payloads and Fading
IEEE Transactions on Information Theory 2021cited by 65position: lastdoi
Quantization of Random Distributions under KL Divergence
2021cited by 9position: lastdoi
Strong Data Processing Constant Is Achieved by Binary Inputs
IEEE Transactions on Information Theory 2021cited by 4position: lastdoi
Massive Access for Future Wireless Communication Systems
IEEE Wireless Communications 2020cited by 231position: middledoi
Sampling of the Wiener Process for Remote Estimation Over a Channel With Random Delay
IEEE Transactions on Information Theory 2019cited by 204position: middledoi
Improved bounds on Gaussian MAC and sparse regression via Gaussian inequalities
2019cited by 55position: middledoi
Short-Packet Low-Power Coded Access for Massive MAC
2019cited by 27position: lastdoi
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding
2019cited by 2position: lastdoi
Ozarow- Type Outer Bounds for Memoryless Sources and Channels
2018cited by 7position: lastdoi
List-Decodable Zero-Rate Codes
IEEE Transactions on Information Theory 2018cited by 1position: lastdoi
A perspective on massive random-access
2017cited by 472position: firstdoi
Low complexity schemes for the random access Gaussian channel
2017cited by 221position: lastdoi
Remote estimation of the Wiener process over a channel with random delay
2017cited by 205position: middledoi
Sampling of the Wiener Process for Remote Estimation over a Channel with Random Delay
arXiv (Cornell University) 2017cited by 5position: middledoi
Defect Tolerance: Fundamental Limits and Examples
IEEE Transactions on Information Theory 2017cited by 2position: middledoi
Wasserstein Continuity of Entropy and Outer Bounds for Interference Channels
IEEE Transactions on Information Theory 2016cited by 102position: firstdoi
Dispersion of the coherent MIMO block-fading channel
2016cited by 15position: lastdoi
Converse bounds for interference channels via coupling and proof of Costa's conjecture
2016cited by 2position: firstdoi
Defect tolerance: Fundamental limits and examples
2016cited by 1position: middledoi
Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels
IEEE Transactions on Communications 2015cited by 217position: middledoi

Grants

Collaborative Research: CIF: Small: Low-Complexity Algorithms for Unsourced Multiple Access and Compressed Sensing in Large Dimensions
NSF2131115$175,0002021–2025PIRePORTER
CIF: Small: Fundamental limits and coding for massive wireless random-access
NSF1717842$450,0002017–2022PIRePORTER
CAREER: Information Theory Beyond Capacity
NSF1253205$625,2382013–2019PIRePORTER
CIF: Small: Collaborative Research: Combinatorial Joint Source-Channel Coding
NSF1318620$250,0002013–2017PIRePORTER

Frequent collaborators

Or Ordentlich · Hebrew University of Jerusalem6 papers (2017–2025)Jennifer Tang · IIT@MIT5 papers (2016–2022)Wei Yang · Princeton University5 papers (2013–2020)Yihong Wu · Princeton University5 papers (2015–2024)Yuval Kochman · Hebrew University of Jerusalem4 papers (2012–2019) · 4 papers (2013–2015) · 3 papers (2013–2015)Elif Uysal‐Biyikoglu · Middle East Technical University3 papers (2017–2019)Gregory W. Wornell · Massachusetts Institute of Technology3 papers (2014–2017)Yin Sun · Auburn University3 papers (2017–2019)Borjan Geshkovski · Massachusetts Institute of Technology2 papers (2024–2025)Arya Mazumdar · University of California San Diego2 papers (2012–2012)Giuseppe Caire · Technische Universität Berlin2 papers (2015–2020)Suhas S Kowshik · IIT@MIT2 papers (2019–2021)Austin Collins · IIT@MIT2 papers (2014–2016)Philippe Rigollet · Massachusetts Institute of Technology2 papers (2024–2025)Aviv Adler · IIT@MIT2 papers (2021–2022) · 1 papers (2019–2019)Chenghao Guo · Peking University1 papers (2023–2023)Shidong Zhou · Texas A&M University1 papers (2020–2020)