default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYury Polyanskiy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j44]Qian Yu
, Yury Polyanskiy:
Ising Model on Locally Tree-Like Graphs: Uniqueness of Solutions to Cavity Equations. IEEE Trans. Inf. Theory 70(3): 1913-1938 (2024)- [j43]Patrik Róbert Gerber, Yury Polyanskiy:
Likelihood-Free Hypothesis Testing. IEEE Trans. Inf. Theory 70(11): 7971-8000 (2024) - [c100]Guy Bresler, Chenghao Guo, Yury Polyanskiy:
Thresholds for Reconstruction of Random Hypergraphs From Graph Projections. COLT 2024: 632-647 - [c99]Tejas Jayashankar, Binoy Kurien, Alejandro Lancho, Gary C. F. Lee, Yury Polyanskiy, Amir Weiss, Gregory W. Wornell:
The Data-Driven Radio Frequency Signal Separation Challenge. ICASSP Workshops 2024: 53-54 - [i89]Patrick Agostini, Jean-François Chamberland, Federico Clazzer, Johannes Dommel, Gianluigi Liva, Andrea Munari, Krishna Narayanan, Yury Polyanskiy, Slawomir Stanczak, Zoran Utkovski:
Evolution of the 5G New Radio Two-Step Random Access towards 6G Unsourced MAC. CoRR abs/2405.03348 (2024) - [i88]Gianluigi Liva, Yury Polyanskiy:
Unsourced Multiple Access: A Coding Paradigm for Massive Random Access. CoRR abs/2408.09874 (2024) - [i87]Pietro Caputo, Zongchen Chen, Yuzhou Gu, Yury Polyanskiy:
Entropy Contractions in Markov Chains: Half-Step, Full-Step and Continuous-Time. CoRR abs/2409.07689 (2024) - [i86]Alejandro Lancho, Amir Weiss, Gary C. F. Lee, Tejas Jayashankar, Binoy Kurien, Yury Polyanskiy, Gregory W. Wornell:
RF Challenge: The Data-Driven Radio Frequency Signal Separation Challenge. CoRR abs/2409.08839 (2024) - [i85]Borjan Geshkovski, Hugo Koubbi, Yury Polyanskiy, Philippe Rigollet:
Dynamic metastability in the self-attention model. CoRR abs/2410.06833 (2024) - [i84]Or Ordentlich, Yury Polyanskiy:
Optimal Quantization for Matrix Multiplication. CoRR abs/2410.13780 (2024) - 2023
- [j42]Jennifer Tang, Yury Polyanskiy:
Capacity of Noisy Permutation Channels. IEEE Trans. Inf. Theory 69(7): 4145-4162 (2023) - [c98]Adam Block, Yury Polyanskiy:
The Sample Complexity of Approximate Rejection Sampling With Applications to Smoothed Online Learning. COLT 2023: 228-273 - [c97]Yuzhou Gu, Yury Polyanskiy:
Uniqueness of BP fixed point for the Potts model and applications to community detection. COLT 2023: 837-884 - [c96]Yuzhou Gu, Yury Polyanskiy:
Weak Recovery Threshold for the Hypergraph Stochastic Block Model. COLT 2023: 885-920 - [c95]Zeyu Jia, Yury Polyanskiy, Yihong Wu:
Entropic characterization of optimal rates for learning Gaussian mixtures. COLT 2023: 4296-4335 - [c94]Soham Jana, Yury Polyanskiy, Anzo Z. Teh, Yihong Wu:
Empirical Bayes via ERM and Rademacher complexities: the Poisson model. COLT 2023: 5199-5235 - [c93]Patrik R. Gerber, Yanjun Han, Yury Polyanskiy:
Minimax optimal testing by classification. COLT 2023: 5395-5432 - [c92]Guy Bresler, Chenghao Guo, Yury Polyanskiy:
Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles. FOCS 2023: 2149-2158 - [c91]Gary C. F. Lee, Amir Weiss, Alejandro Lancho, Yury Polyanskiy, Gregory W. Wornell:
On Neural Architectures for Deep Learning-Based Source Separation of Co-Channel OFDM Signals. ICASSP 2023: 1-5 - [c90]Anzo Teh, Yury Polyanskiy:
Comparing Poisson and Gaussian channels. ISIT 2023: 36-41 - [c89]Qian Yu, Yury Polyanskiy:
Uniqueness of Distributional BP Fixed Point in Ising Model on Trees. ISIT 2023: 2476-2481 - [c88]Alexander Fengler, Alejandro Lancho, Krishna Narayanan, Yury Polyanskiy:
On the Advantages of Asynchrony in the Unsourced MAC. ISIT 2023: 2523-2528 - [c87]Alexander Fengler, Alejandro Lancho, Yury Polyanskiy:
Coded Orthogonal Modulation for the Multi-Antenna MAC. ISTC 2023: 1-5 - [c86]Patrik Róbert Gerber, Tianze Jiang, Yury Polyanskiy, Rui Sun:
Kernel-Based Tests for Likelihood-Free Hypothesis Testing. NeurIPS 2023 - [c85]Borjan Geshkovski, Cyril Letrouit, Yury Polyanskiy, Philippe Rigollet:
The emergence of clusters in self-attention dynamics. NeurIPS 2023 - [c84]Tejas Jayashankar, Gary C. F. Lee, Alejandro Lancho, Amir Weiss, Yury Polyanskiy, Gregory W. Wornell:
Score-based Source Separation with Applications to Digital Communication Signals. NeurIPS 2023 - [i83]Adam Block, Yury Polyanskiy:
The Sample Complexity of Approximate Rejection Sampling with Applications to Smoothed Online Learning. CoRR abs/2302.04658 (2023) - [i82]Gary C. F. Lee, Amir Weiss, Alejandro Lancho, Yury Polyanskiy, Gregory W. Wornell:
On Neural Architectures for Deep Learning-based Source Separation of Co-Channel OFDM Signals. CoRR abs/2303.06438 (2023) - [i81]Yuzhou Gu, Yury Polyanskiy:
Uniqueness of BP fixed point for the Potts model and applications to community detection. CoRR abs/2303.14688 (2023) - [i80]Yuzhou Gu, Yury Polyanskiy:
Weak Recovery Threshold for the Hypergraph Stochastic Block Model. CoRR abs/2303.14689 (2023) - [i79]Borjan Geshkovski, Cyril Letrouit, Yury Polyanskiy, Philippe Rigollet:
The emergence of clusters in self-attention dynamics. CoRR abs/2305.05465 (2023) - [i78]Alexander Fengler, Alejandro Lancho, Krishna Narayanan, Yury Polyanskiy:
On the Advantages of Asynchrony in the Unsourced MAC. CoRR abs/2305.06985 (2023) - [i77]Guy Bresler, Chenghao Guo, Yury Polyanskiy:
Algorithmic Decorrelation and Planted Clique in Dependent Random Graphs: The Case of Extra Triangles. CoRR abs/2305.09995 (2023) - [i76]Patrik Róbert Gerber, Yanjun Han, Yury Polyanskiy:
Minimax optimal testing by classification. CoRR abs/2306.11085 (2023) - [i75]Zeyu Jia, Yury Polyanskiy, Yihong Wu:
Entropic characterization of optimal rates for learning Gaussian mixtures. CoRR abs/2306.12308 (2023) - [i74]Tejas Jayashankar, Gary C. F. Lee, Alejandro Lancho, Amir Weiss, Yury Polyanskiy, Gregory W. Wornell:
Score-based Source Separation with Applications to Digital Communication Signals. CoRR abs/2306.14411 (2023) - [i73]Anzo Teh, Yury Polyanskiy:
Comparing Poisson and Gaussian channels (extended). CoRR abs/2306.16735 (2023) - [i72]Alexander Fengler, Alejandro Lancho, Yury Polyanskiy:
Coded Orthogonal Modulation for the Multi-Antenna Multiple-Access Channel. CoRR abs/2307.01095 (2023) - [i71]Patrik Róbert Gerber, Tianze Jiang, Yury Polyanskiy, Rui Sun:
Kernel-Based Tests for Likelihood-Free Hypothesis Testing. CoRR abs/2308.09043 (2023) - [i70]Borjan Geshkovski, Cyril Letrouit, Yury Polyanskiy, Philippe Rigollet:
A mathematical perspective on Transformers. CoRR abs/2312.10794 (2023) - 2022
- [j41]Adam Block, Zeyu Jia, Yury Polyanskiy, Alexander Rakhlin:
Intrinsic Dimension Estimation Using Wasserstein Distance. J. Mach. Learn. Res. 23: 313:1-313:37 (2022) - [j40]Aviv Adler, Jennifer Tang, Yury Polyanskiy:
Efficient Representation of Large-Alphabet Probability Distributions. IEEE J. Sel. Areas Inf. Theory 3(4): 651-663 (2022) - [j39]Or Ordentlich, Yury Polyanskiy:
Strong Data Processing Constant Is Achieved by Binary Inputs. IEEE Trans. Inf. Theory 68(3): 1480-1481 (2022) - [j38]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Two-Dimensional Regular Grids. IEEE Trans. Inf. Theory 68(10): 6297-6334 (2022) - [c83]Alexander Fengler, Gianluigi Liva, Yury Polyanskiy:
Sparse Graph Codes for the 2-User Unsourced MAC. IEEECONF 2022: 682-686 - [c82]Alejandro Lancho, Alexander Fengler, Yury Polyanskiy:
Finite-Blocklength Results for the A-channel: Applications to Unsourced Random Access and Group Testing. Allerton 2022: 1-8 - [c81]Alejandro Lancho, Amir Weiss, Gary C. F. Lee, Jennifer Tang, Yuheng Bu, Yury Polyanskiy, Gregory W. Wornell:
Data-Driven Blind Synchronization and Interference Rejection for Digital Communication Signals. GLOBECOM 2022: 2296-2302 - [c80]Aviv Adler, Jennifer Tang, Yury Polyanskiy:
Efficient Representation of Large-Alphabet Probability Distributions via Arcsinh-Compander. ISIT 2022: 162-167 - [c79]Jennifer Tang, Yury Polyanskiy:
Capacity of Noisy Permutation Channels. ISIT 2022: 1987-1992 - [c78]Gary C. F. Lee, Amir Weiss, Alejandro Lancho, Jennifer Tang, Yuheng Bu, Yury Polyanskiy, Gregory W. Wornell:
Exploiting Temporal Structures of Cyclostationary Signals for Data-Driven Single-Channel Source Separation. MLSP 2022: 1-6 - [i69]Guy Bresler, Chenghao Guo, Yury Polyanskiy:
Linear Programs with Polynomial Coefficients and Applications to 1D Cellular Automata. CoRR abs/2204.06357 (2022) - [i68]Adam Block, Zeyu Jia, Yury Polyanskiy, Alexander Rakhlin:
Rate of convergence of the smoothed empirical Wasserstein distance. CoRR abs/2205.02128 (2022) - [i67]Aviv Adler, Jennifer Tang, Yury Polyanskiy:
Efficient Representation of Large-Alphabet Probability Distributions. CoRR abs/2205.03752 (2022) - [i66]Gary C. F. Lee, Amir Weiss, Alejandro Lancho, Jennifer Tang, Yuheng Bu, Yury Polyanskiy, Gregory W. Wornell:
Exploiting Temporal Structures of Cyclostationary Signals for Data-Driven Single-Channel Source Separation. CoRR abs/2208.10325 (2022) - [i65]Alejandro Lancho, Amir Weiss, Gary C. F. Lee, Jennifer Tang, Yuheng Bu, Yury Polyanskiy, Gregory W. Wornell:
Data-Driven Blind Synchronization and Interference Rejection for Digital Communication Signals. CoRR abs/2209.04871 (2022) - [i64]Alejandro Lancho, Alexander Fengler, Yury Polyanskiy:
Finite-Blocklength Results for the A-channel: Applications to Unsourced Random Access and Group Testing. CoRR abs/2210.01951 (2022) - [i63]Patrik Róbert Gerber, Yury Polyanskiy:
Likelihood-free hypothesis testing. CoRR abs/2211.01126 (2022) - [i62]Qian Yu, Yury Polyanskiy:
Ising Model on Locally Tree-like Graphs: Uniqueness of Solutions to Cavity Equations. CoRR abs/2211.15242 (2022) - 2021
- [j37]Ziv Goldfeld, Guy Bresler, Yury Polyanskiy:
Information Storage in the Stochastic Ising Model. IEEE Trans. Inf. Theory 67(3): 1373-1399 (2021) - [j36]Alankrita Bhatt, Bobak Nazer, Or Ordentlich, Yury Polyanskiy:
Information-Distilling Quantizers. IEEE Trans. Inf. Theory 67(4): 2472-2487 (2021) - [j35]Suhas S. Kowshik, Yury Polyanskiy:
Fundamental Limits of Many-User MAC With Finite Payloads and Fading. IEEE Trans. Inf. Theory 67(9): 5853-5884 (2021) - [c77]Gianluigi Liva, Yury Polyanskiy:
On Coding Techniques for Unsourced Multiple-Access. ACSCC 2021: 1507-1514 - [c76]Emmanuel Abbe, Elisabetta Cornacchia, Yuzhou Gu, Yury Polyanskiy:
Stochastic block model entropy and broadcasting on trees with survey. COLT 2021: 1-25 - [c75]Meir Feder, Yury Polyanskiy:
Sequential prediction under log-loss and misspecification. COLT 2021: 1937-1964 - [c74]Qian Yu, Yury Polyanskiy:
Broadcasting on Trees Near Criticality: Perturbation Theory. ISIT 2021: 2101-2106 - [c73]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Reconstruction on 2D Regular Grids. ISIT 2021: 2107-2112 - [c72]Aviv Adler, Jennifer Tang, Yury Polyanskiy:
Quantization of Random Distributions under KL Divergence. ISIT 2021: 2762-2767 - [i61]Emmanuel Abbe, Elisabetta Cornacchia, Yuzhou Gu, Yury Polyanskiy:
Stochastic block model entropy and broadcasting on trees with survey. CoRR abs/2101.12601 (2021) - [i60]Meir Feder, Yury Polyanskiy:
Sequential prediction under log-loss and misspecification. CoRR abs/2102.00050 (2021) - [i59]Adam Block, Zeyu Jia, Yury Polyanskiy, Alexander Rakhlin:
Intrinsic Dimension Estimation. CoRR abs/2106.04018 (2021) - [i58]Yury Polyanskiy, Yihong Wu:
Sharp regret bounds for empirical Bayes and compound decision problems. CoRR abs/2109.03943 (2021) - [i57]Jennifer Tang, Yury Polyanskiy:
Capacity of Noisy Permutation Channels. CoRR abs/2111.00559 (2021) - 2020
- [j34]Ziv Goldfeld, Yury Polyanskiy:
The Information Bottleneck Problem and its Applications in Machine Learning. IEEE J. Sel. Areas Inf. Theory 1(1): 19-38 (2020) - [j33]Suhas S. Kowshik, Kirill V. Andreev, Alexey A. Frolov, Yury Polyanskiy:
Energy Efficient Coded Random Access for the Wireless Uplink. IEEE Trans. Commun. 68(8): 4694-4708 (2020) - [j32]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Random Directed Acyclic Graphs. IEEE Trans. Inf. Theory 66(2): 780-812 (2020) - [j31]Yin Sun, Yury Polyanskiy, Elif Uysal:
Sampling of the Wiener Process for Remote Estimation Over a Channel With Random Delay. IEEE Trans. Inf. Theory 66(2): 1118-1135 (2020) - [j30]Ziv Goldfeld, Kristjan H. Greenewald, Jonathan Niles-Weed, Yury Polyanskiy:
Convergence of Smoothed Empirical Measures With Applications to Entropy Estimation. IEEE Trans. Inf. Theory 66(7): 4368-4391 (2020) - [j29]Yuval Kochman, Or Ordentlich, Yury Polyanskiy:
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding. IEEE Trans. Inf. Theory 66(8): 4722-4741 (2020) - [j28]Or Ordentlich, Yury Polyanskiy, Ofer Shayevitz:
A Note on the Probability of Rectangles for Correlated Binary Strings. IEEE Trans. Inf. Theory 66(12): 7878-7886 (2020) - [j27]Yongpeng Wu, Xiqi Gao, Shidong Zhou, Wei Yang, Yury Polyanskiy, Giuseppe Caire:
Massive Access for Future Wireless Communication Systems. IEEE Wirel. Commun. 27(4): 148-156 (2020) - [c71]Soham Jana, Yury Polyanskiy, Yihong Wu:
Extrapolating the profile of a finite population. COLT 2020: 2011-2033 - [c70]Hajir Roozbehani, Yury Polyanskiy:
Graceful degradation over the BEC via non-linear codes. ISIT 2020: 280-285 - [c69]Yuzhou Gu, Hajir Roozbehani, Yury Polyanskiy:
Broadcasting on trees near criticality. ISIT 2020: 1504-1509 - [i56]Ziv Goldfeld, Yury Polyanskiy:
The Information Bottleneck Problem and Its Applications in Machine Learning. CoRR abs/2004.14941 (2020) - [i55]Yuzhou Gu, Yury Polyanskiy:
Non-linear Log-Sobolev inequalities for the Potts semigroup and applications to reconstruction problems. CoRR abs/2005.05444 (2020) - [i54]Yuzhou Gu, Hajir Roozbehani, Yury Polyanskiy:
Broadcasting on trees near criticality. CoRR abs/2005.07801 (2020) - [i53]Soham Jana, Yury Polyanskiy, Yihong Wu:
Extrapolating the profile of a finite population. CoRR abs/2005.10561 (2020) - [i52]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Two-Dimensional Regular Grids. CoRR abs/2010.01390 (2020) - [i51]Or Ordentlich, Yury Polyanskiy:
Strong data processing constant is achieved by binary inputs. CoRR abs/2010.01987 (2020)
2010 – 2019
- 2019
- [j26]Yury Polyanskiy:
Hypercontractivity of Spherical Averages in Hamming Space. SIAM J. Discret. Math. 33(2): 731-754 (2019) - [j25]Austin Collins, Yury Polyanskiy:
Coherent Multiple-Antenna Block-Fading Channels at Finite Blocklength. IEEE Trans. Inf. Theory 65(1): 380-405 (2019) - [j24]Noga Alon, Boris Bukh, Yury Polyanskiy:
List-Decodable Zero-Rate Codes. IEEE Trans. Inf. Theory 65(3): 1657-1667 (2019) - [c68]Suhas S. Kowshik, Kirill V. Andreev, Alexey A. Frolov, Yury Polyanskiy:
Short-Packet Low-Power Coded Access for Massive MAC. ACSSC 2019: 827-832 - [c67]Christos Thrampoulidis, Ilias Zadik, Yury Polyanskiy:
A Simple Bound on the BER of the Map Decoder for Massive MIMO Systems. ICASSP 2019: 4544-4548 - [c66]Ziv Goldfeld, Ewout van den Berg, Kristjan H. Greenewald, Igor Melnyk, Nam Nguyen, Brian Kingsbury, Yury Polyanskiy:
Estimating Information Flow in Deep Neural Networks. ICML 2019: 2299-2308 - [c65]Ilias Zadik, Yury Polyanskiy, Christos Thrampoulidis:
Improved bounds on Gaussian MAC and sparse regression via Gaussian inequalities. ISIT 2019: 430-434 - [c64]Suhas S. Kowshik, Yury Polyanskiy:
Quasi-static fading MAC with many users and finite payload. ISIT 2019: 440-444 - [c63]Ziv Goldfeld, Guy Bresler, Yury Polyanskiy:
Information Storage in the Stochastic Ising Model at Low Temperature. ISIT 2019: 732-736 - [c62]Ziv Goldfeld, Kristjan H. Greenewald, Jonathan Weed, Yury Polyanskiy:
Optimality of the Plug-in Estimator for Differential Entropy Estimation under Gaussian Convolutions. ISIT 2019: 892-896 - [c61]Yuval Kochman, Or Ordentlich, Yury Polyanskiy:
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding. ISIT 2019: 1332-1336 - [c60]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Random Networks. ISIT 2019: 1632-1636 - [c59]Uri Hadar, Jingbo Liu, Yury Polyanskiy, Ofer Shayevitz:
Error Exponents in Distributed Hypothesis Testing of Correlations. ISIT 2019: 2674-2678 - [c58]Suhas S. Kowshik, Kirill V. Andreev, Alexey A. Frolov, Yury Polyanskiy:
Energy efficient random access for the quasi-static fading MAC. ISIT 2019: 2768-2772 - [c57]Wasim Huleihel, Yury Polyanskiy, Ofer Shayevitz:
Relaying One Bit Across a Tandem of Binary-Symmetric Channels. ISIT 2019: 2928-2932 - [c56]Uri Hadar, Jingbo Liu, Yury Polyanskiy, Ofer Shayevitz:
Communication complexity of estimating correlations. STOC 2019: 792-803 - [c55]Kirill V. Andreev, Suhas S. Kowshik, Alexey A. Frolov, Yury Polyanskiy:
Low Complexity Energy Efficient Random Access Scheme for the Asynchronous Fading MAC. VTC Fall 2019: 1-5 - [i50]Suhas S. Kowshik, Yury Polyanskiy:
Fundamental limits of many-user MAC with finite payloads and fading. CoRR abs/1901.06732 (2019) - [i49]Uri Hadar, Jingbo Liu, Yury Polyanskiy, Ofer Shayevitz:
Communication Complexity of Estimating Correlations. CoRR abs/1901.09100 (2019) - [i48]Yury Polyanskiy, Yihong Wu:
Dualizing Le Cam's method, with applications to estimating the unseens. CoRR abs/1902.05616 (2019) - [i47]Yuval Kochman, Or Ordentlich, Yury Polyanskiy:
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding. CoRR abs/1902.07979 (2019) - [i46]Christos Thrampoulidis, Ilias Zadik, Yury Polyanskiy:
A simple bound on the BER of the MAP decoder for massive MIMO systems. CoRR abs/1903.03949 (2019) - [i45]Ziv Goldfeld, Kristjan H. Greenewald, Yury Polyanskiy, Jonathan Weed:
Convergence of Smoothed Empirical Measures with Applications to Entropy Estimation. CoRR abs/1905.13576 (2019) - [i44]Suhas S. Kowshik, Kirill V. Andreev, Alexey A. Frolov, Yury Polyanskiy:
Energy efficient coded random access for the wireless uplink. CoRR abs/1907.09448 (2019) - [i43]Or Ordentlich, Yury Polyanskiy, Ofer Shayevitz:
A Note on the Probability of Rectangles for Correlated Binary Strings. CoRR abs/1909.01221 (2019) - [i42]Yongpeng Wu, Xiqi Gao, Shidong Zhou, Wei Yang, Yury Polyanskiy, Giuseppe Caire:
Massive Access for Future Wireless Communication Systems. CoRR abs/1910.12678 (2019) - [i41]Hajir Roozbehani, Yury Polyanskiy:
Low density majority codes and the problem of graceful degradation. CoRR abs/1911.12263 (2019) - 2018
- [j23]Flávio du Pin Calmon, Yury Polyanskiy, Yihong Wu:
Strong Data Processing Inequalities for Input Constrained Additive Noise Channels. IEEE Trans. Inf. Theory 64(3): 1879-1892 (2018) - [j22]Jennifer Tang, Da Wang, Yury Polyanskiy, Gregory W. Wornell:
Defect Tolerance: Fundamental Limits and Examples. IEEE Trans. Inf. Theory 64(7): 5240-5260 (2018) - [j21]Anuran Makur, Yury Polyanskiy:
Comparison of Channels: Criteria for Domination by a Symmetric Channel. IEEE Trans. Inf. Theory 64(8): 5704-5725 (2018) - [j20]Marco Dalai, Yury Polyanskiy:
Bounds on the Reliability Function of Typewriter Channels. IEEE Trans. Inf. Theory 64(9): 6208-6222 (2018) - [j19]Wei Yang, Austin Collins, Giuseppe Durisi, Yury Polyanskiy, H. Vincent Poor:
Beta-Beta Bounds: Finite-Blocklength Analog of the Golden Formula. IEEE Trans. Inf. Theory 64(9): 6236-6256 (2018) - [c54]S. Hamed Hassani, Shrinivas Kudekar, Or Ordentlich, Yury Polyanskiy, Rüdiger L. Urbanke:
Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels. ISIT 2018: 311-315 - [c53]Or Ordentlich, Yury Polyanskiy:
Entropy Under Additive Bernoulli and Spherical Noises. ISIT 2018: 521-525 - [c52]Yuval Kochman, Or Ordentlich, Yury Polyanskiy:
Ozarow- Type Outer Bounds for Memoryless Sources and Channels. ISIT 2018: 1774-1778 - [c51]Ziv Goldfeld, Guy Bresler, Yury Polyanskiy:
Information Storage in the Stochastic Ising Model at Zero Temperature. ISIT 2018: 2127-2131 - [c50]Hajir Roozbehani, Yury Polyanskiy:
Input-Output Distance Properties of Good Linear Codes. ISIT 2018: 2510-2514 - [i40]S. Hamed Hassani, Shrinivas Kudekar, Or Ordentlich, Yury Polyanskiy, Rüdiger L. Urbanke:
Almost Optimal Scaling of Reed-Muller Codes on BEC and BSC Channels. CoRR abs/1801.09481 (2018) - [i39]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Bounded Degree DAGs. CoRR abs/1803.07527 (2018) - [i38]Ziv Goldfeld, Guy Bresler, Yury Polyanskiy:
Information Storage in the Stochastic Ising Model. CoRR abs/1805.03027 (2018) - [i37]Yury Polyanskiy, Yihong Wu:
Application of information-percolation method to reconstruction problems on graphs. CoRR abs/1806.04195 (2018) - [i36]Ziv Goldfeld, Ewout van den Berg, Kristjan H. Greenewald, Igor Melnyk, Nam Nguyen, Brian Kingsbury, Yury Polyanskiy:
Estimating Information Flow in Neural Networks. CoRR abs/1810.05728 (2018) - [i35]Anuran Makur, Elchanan Mossel, Yury Polyanskiy:
Broadcasting on Random Directed Acyclic Graphs. CoRR abs/1811.03946 (2018) - [i34]Alankrita Bhatt, Bobak Nazer, Or Ordentlich, Yury Polyanskiy:
Information-Distilling Quantizers. CoRR abs/1812.03031 (2018) - 2017
- [j18]Yury Polyanskiy:
On metric properties of maps between Hamming spaces and related graph homomorphisms. J. Comb. Theory A 145: 227-251 (2017) - [j17]Victoria Kostina, Yury Polyanskiy, Sergio Verdú:
Joint Source-Channel Coding With Feedback. IEEE Trans. Inf. Theory 63(6): 3502-3515 (2017) - [c49]Yury Polyanskiy, Ananda Theertha Suresh, Yihong Wu:
Sample complexity of population recovery. COLT 2017: 1589-1618 - [c48]Bobak Nazer, Or Ordentlich, Yury Polyanskiy:
Information-distilling quantizers. ISIT 2017: 96-100 - [c47]Yin Sun, Yury Polyanskiy, Elif Uysal-Biyikoglu:
Remote estimation of the Wiener process over a channel with random delay. ISIT 2017: 321-325 - [c46]Anuran Makur, Yury Polyanskiy:
Less noisy domination by symmetric channels. ISIT 2017: 2463-2467 - [c45]Yury Polyanskiy:
A perspective on massive random-access. ISIT 2017: 2523-2527 - [c44]Or Ordentlich, Yury Polyanskiy:
Low complexity schemes for the random access Gaussian channel. ISIT 2017: 2528-2532 - [i33]Yin Sun, Yury Polyanskiy, Elif Uysal-Biyikoglu:
Remote Estimation of the Wiener Process over a Channel with Random Delay. CoRR abs/1701.06734 (2017) - [i32]Yury Polyanskiy, Ananda Theertha Suresh, Yihong Wu:
Sample complexity of population recovery. CoRR abs/1702.05574 (2017) - [i31]Marco Dalai, Yury Polyanskiy:
Bounds on the reliability of typewriter channels. CoRR abs/1702.07703 (2017) - [i30]Austin Collins, Yury Polyanskiy:
Coherent multiple-antenna block-fading channels at finite blocklength. CoRR abs/1704.06962 (2017) - [i29]Wei Yang, Austin Collins, Giuseppe Durisi, Yury Polyanskiy, H. Vincent Poor:
Beta-Beta Bounds: Finite-Blocklength Analog of the Golden Formula. CoRR abs/1706.05972 (2017) - [i28]Noga Alon, Boris Bukh, Yury Polyanskiy:
List-decodable zero-rate codes. CoRR abs/1710.10663 (2017) - 2016
- [j16]Giuseppe Durisi, Tobias Koch, Johan Östman, Yury Polyanskiy, Wei Yang:
Short-Packet Communications Over Multiple-Antenna Rayleigh-Fading Channels. IEEE Trans. Commun. 64(2): 618-629 (2016) - [j15]Yury Polyanskiy, Yihong Wu:
Dissipation of Information in Channels With Input Constraints. IEEE Trans. Inf. Theory 62(1): 35-55 (2016) - [j14]Yury Polyanskiy:
Upper Bound on List-Decoding Radius of Binary Codes. IEEE Trans. Inf. Theory 62(3): 1119-1128 (2016) - [j13]Yury Polyanskiy, Yihong Wu:
Wasserstein Continuity of Entropy and Outer Bounds for Interference Channels. IEEE Trans. Inf. Theory 62(7): 3992-4002 (2016) - [j12]Wei Yang, Giuseppe Durisi, Yury Polyanskiy:
Minimum Energy to Send $k$ Bits Over Multiple-Antenna Fading Channels. IEEE Trans. Inf. Theory 62(12): 6831-6853 (2016) - [c43]Austin Collins, Yury Polyanskiy:
Dispersion of the coherent MIMO block-fading channel. ISIT 2016: 1068-1072 - [c42]Daniel F. Cullina, Marco Dalai, Yury Polyanskiy:
Rate-distance tradeoff for codes above graph capacity. ISIT 2016: 1331-1335 - [c41]Marco Dalai, Yury Polyanskiy:
Bounds on the reliability of a typewriter channel. ISIT 2016: 1715-1719 - [c40]Yury Polyanskiy, Yihong Wu:
Converse bounds for interference channels via coupling and proof of Costa's conjecture. ISIT 2016: 2209-2213 - [c39]Wei Yang, Austin Collins, Giuseppe Durisi, Yury Polyanskiy, H. Vincent Poor:
A beta-beta achievability bound with applications. ISIT 2016: 2669-2673 - [c38]Jennifer Tang, Da Wang, Yury Polyanskiy, Gregory W. Wornell:
Defect tolerance: Fundamental limits and examples. ISIT 2016: 3028-3032 - [c37]Arya Mazumdar, Yury Polyanskiy, Ankit Singh Rawat, Hajir Roozbehani:
Distance preserving maps and combinatorial joint source-channel coding for large alphabets. ISIT 2016: 3067-3071 - [i27]Wei Yang, Austin Collins, Giuseppe Durisi, Yury Polyanskiy, H. Vincent Poor:
A Beta-Beta Achievability Bound with Applications. CoRR abs/1601.05880 (2016) - [i26]Yury Polyanskiy, Alex Samorodnitsky:
Improved log-Sobolev inequalities, hypercontractivity and uncertainty principle on the hypercube. CoRR abs/1606.07491 (2016) - [i25]Marco Dalai, Yury Polyanskiy:
Bounds on the Reliability of a Typewriter Channel. CoRR abs/1607.05064 (2016) - [i24]Daniel Cullina, Marco Dalai, Yury Polyanskiy:
Rate-distance tradeoff for codes above graph capacity. CoRR abs/1607.06384 (2016) - [i23]Anuran Makur, Yury Polyanskiy:
Comparison of channels: criteria for domination by a symmetric channel. CoRR abs/1609.06877 (2016) - [i22]Jennifer Tang, Da Wang, Yury Polyanskiy, Gregory W. Wornell:
Defect tolerance: fundamental limits and examples. CoRR abs/1610.02578 (2016) - 2015
- [j11]Victoria Kostina, Yury Polyanskiy, Sergio Verdú:
Variable-Length Compression Allowing Errors. IEEE Trans. Inf. Theory 61(8): 4316-4330 (2015) - [j10]Wei Yang, Giuseppe Caire, Giuseppe Durisi, Yury Polyanskiy:
Optimum Power Control at Finite Blocklength. IEEE Trans. Inf. Theory 61(9): 4598-4615 (2015) - [c36]Ganesh Ajjanagadde, Yury Polyanskiy:
Adder MAC and estimates for Rényi entropy. Allerton 2015: 434-441 - [c35]Ali Makhdoumi, Shao-Lun Huang, Muriel Médard, Yury Polyanskiy:
On locally decodable source coding. ICC 2015: 4394-4399 - [c34]Andrew J. Young, Yury Polyanskiy:
Converse and duality results for combinatorial source-channel coding in binary Hamming spaces. ISIT 2015: 261-265 - [c33]Victoria Kostina, Yury Polyanskiy, Sergio Verdú:
Joint source-channel coding with feedback. ISIT 2015: 276-280 - [c32]Yury Polyanskiy:
Upper bound on list-decoding radius of binary codes. ISIT 2015: 2231-2235 - [c31]Flávio P. Calmon, Yury Polyanskiy, Yihong Wu:
Strong data processing inequalities in power-constrained Gaussian channels. ISIT 2015: 2558-2562 - [c30]Wei Yang, Giuseppe Durisi, Yury Polyanskiy:
Minimum energy to send k bits over Rayleigh-fading channels. ISIT 2015: 2959-2963 - [c29]Victoria Kostina, Yury Polyanskiy, Sergio Verdú:
Transmitting k samples over the Gaussian channel: Energy-distortion tradeoff. ITW 2015: 1-5 - [i21]Victoria Kostina, Yury Polyanskiy, Sergio Verdú:
Joint source-channel coding with feedback (extended). CoRR abs/1501.07640 (2015) - [i20]Yury Polyanskiy:
On metric properties of maps between Hamming spaces and related graph homomorphisms. CoRR abs/1503.02779 (2015) - [i19]Yury Polyanskiy, Yihong Wu:
Wasserstein continuity of entropy and outer bounds for interference channels. CoRR abs/1504.04419 (2015) - [i18]Wei Yang, Giuseppe Durisi, Yury Polyanskiy:
Minimum Energy to Send k Bits Over Multiple-Antenna Fading Channels. CoRR abs/1507.03843 (2015) - [i17]Marco Dalai, Yury Polyanskiy:
Bounds for codes on pentagon and other cycles. CoRR abs/1508.03020 (2015) - [i16]Yury Polyanskiy, Yihong Wu:
A note on the strong data-processing inequalities in Bayesian networks. CoRR abs/1508.06025 (2015) - [i15]Flávio P. Calmon, Yury Polyanskiy, Yihong Wu:
Strong Data Processing Inequalities for Input Constrained Additive Noise Channels. CoRR abs/1512.06429 (2015) - 2014
- [j9]Yury Polyanskiy, Sergio Verdú:
Empirical Distribution of Good Channel Codes With Nonvanishing Error Probability. IEEE Trans. Inf. Theory 60(1): 5-21 (2014) - [j8]Wei Yang, Giuseppe Durisi, Tobias Koch, Yury Polyanskiy:
Quasi-Static Multiple-Antenna Fading Channels at Finite Blocklength. IEEE Trans. Inf. Theory 60(7): 4232-4265 (2014) - [j7]Yury Polyanskiy, Yihong Wu:
Peak-to-Average Power Ratio of Good Codes for Gaussian Channel. IEEE Trans. Inf. Theory 60(12): 7655-7660 (2014) - [c28]Weihao Gao, Yury Polyanskiy:
On the bit error rate of repeated error-correcting codes. CISS 2014: 1-6 - [c27]Da Wang, Yury Polyanskiy, Gregory W. Wornell:
Scalar quantization with noisy partitions and its application to Flash ADC design. ISIT 2014: 196-200 - [c26]Matthew Johnston, Eytan H. Modiano, Yury Polyanskiy:
Opportunistic scheduling with limited channel state information: A rate distortion approach. ISIT 2014: 1371-1375 - [c25]Hajir Roozbehani, Yury Polyanskiy:
Algebraic methods of classifying directed graphical models. ISIT 2014: 2027-2031 - [c24]Wei Yang, Giuseppe Caire, Giuseppe Durisi, Yury Polyanskiy:
Finite-blocklength channel coding rate under a long-term power constraint. ISIT 2014: 2067-2071 - [c23]Wei Yang, Giuseppe Durisi, Tobias Koch, Yury Polyanskiy:
Dispersion of quasi-static MIMO fading channels via Stokes' theorem. ISIT 2014: 2072-2076 - [c22]Austin Collins, Yury Polyanskiy:
Orthogonal designs optimize achievable dispersion for coherent MISO channels. ISIT 2014: 2524-2528 - [c21]Victoria Kostina, Yury Polyanskiy, Sergio Verdú:
Variable-length compression allowing errors. ISIT 2014: 2679-2683 - [i14]Hajir Roozbehani, Yury Polyanskiy:
Algebraic Methods of Classifying Directed Graphical Models. CoRR abs/1401.5551 (2014) - [i13]Victoria Kostina, Yury Polyanskiy, Sergio Verdú:
Variable-length compression allowing errors (extended). CoRR abs/1402.0608 (2014) - [i12]Yury Polyanskiy, Yihong Wu:
Dissipation of information in channels with input constraints. CoRR abs/1405.3629 (2014) - [i11]Wei Yang, Giuseppe Caire, Giuseppe Durisi, Yury Polyanskiy:
Optimum Power Control at Finite Blocklength. CoRR abs/1406.5422 (2014) - [i10]Yury Polyanskiy:
Upper bound on list-decoding radius of binary codes. CoRR abs/1409.7765 (2014) - [i9]Giuseppe Durisi, Tobias Koch, Johan Östman, Yury Polyanskiy, Wei Yang:
Short-Packet Communications with Multiple Antennas: Transmit Diversity, Spatial Multiplexing, and Channel Estimation Overhead. CoRR abs/1412.7512 (2014) - 2013
- [j6]Yury Polyanskiy:
Asynchronous Communication: Exact Synchronization, Universality, and Dispersion. IEEE Trans. Inf. Theory 59(3): 1256-1270 (2013) - [j5]Yury Polyanskiy:
Saddle Point in the Minimax Converse for Channel Coding. IEEE Trans. Inf. Theory 59(5): 2576-2595 (2013) - [c20]Yury Polyanskiy:
On dispersion of compound DMCs. Allerton 2013: 26-32 - [c19]Alexandr Andoni, Huy L. Nguyên, Yury Polyanskiy, Yihong Wu:
Tight Lower Bound for Linear Sketches of Moments. ICALP (1) 2013: 25-32 - [c18]Arya Mazumdar, Yury Polyanskiy, Barna Saha:
On Chebyshev radius of a set in Hamming space and the closest string problem. ISIT 2013: 1401-1405 - [c17]Wei Yang, Giuseppe Durisi, Tobias Koch, Yury Polyanskiy:
Quasi-static SIMO fading channels at finite blocklength. ISIT 2013: 1531-1535 - [c16]Wei Yang, Giuseppe Durisi, Tobias Koch, Yury Polyanskiy:
Block-Fading Channels at Finite Blocklength. ISWCS 2013: 1-4 - [i8]Yury Polyanskiy, Yihong Wu:
Peak-to-average power ratio of good codes for Gaussian channel. CoRR abs/1302.0084 (2013) - [i7]Wei Yang, Giuseppe Durisi, Tobias Koch, Yury Polyanskiy:
Quasi-Static SIMO Fading Channels at Finite Blocklength. CoRR abs/1302.1302 (2013) - [i6]Alexandr Andoni, Huy L. Nguyen, Yury Polyanskiy, Yihong Wu:
Tight Lower Bound for Linear Sketches of Moments. CoRR abs/1306.6295 (2013) - [i5]Ali Makhdoumi, Shao-Lun Huang, Muriel Médard, Yury Polyanskiy:
On Locally Decodable Source Coding. CoRR abs/1308.5239 (2013) - [i4]Yury Polyanskiy, Sergio Verdú:
Empirical distribution of good channel codes with non-vanishing error probability (extended version). CoRR abs/1309.0141 (2013) - [i3]Yury Polyanskiy:
Hypercontractivity of spherical averages in Hamming space. CoRR abs/1309.3014 (2013) - [i2]Wei Yang, Giuseppe Durisi, Tobias Koch, Yury Polyanskiy:
Quasi-Static MIMO Fading Channels at Finite Blocklength. CoRR abs/1311.2012 (2013) - 2012
- [c15]Yury Polyanskiy:
ℓp-norms of codewords from capacity- and dispersion-achieveing Gaussian codes. Allerton Conference 2012: 294-301 - [c14]Yury Polyanskiy:
On asynchronous capacity and dispersion. CISS 2012: 1-6 - [c13]Yuval Kochman, Arya Mazumdar, Yury Polyanskiy:
The adversarial joint source-channel problem. ISIT 2012: 2112-2116 - [c12]Yury Polyanskiy:
Hypothesis testing via a comparator. ISIT 2012: 2206-2210 - [c11]Yuval Kochman, Arya Mazumdar, Yury Polyanskiy:
Results on combinatorial joint source-channel coding. ITW 2012: 10-14 - [c10]Wei Yang, Giuseppe Durisi, Tobias Koch, Yury Polyanskiy:
Diversity versus channel knowledge at finite block-length. ITW 2012: 572-576 - [i1]Wei Yang, Giuseppe Durisi, Tobias Koch, Yury Polyanskiy:
Diversity versus Channel Knowledge at Finite Block-Length. CoRR abs/1204.2927 (2012) - 2011
- [j4]Yury Polyanskiy, Harold Vincent Poor, Sergio Verdú:
Dispersion of the Gilbert-Elliott Channel. IEEE Trans. Inf. Theory 57(4): 1829-1848 (2011) - [j3]Yury Polyanskiy, H. Vincent Poor, Sergio Verdú:
Minimum Energy to Send k Bits Through the Gaussian Channel With and Without Feedback. IEEE Trans. Inf. Theory 57(8): 4880-4902 (2011) - [j2]Yury Polyanskiy, H. Vincent Poor, Sergio Verdú:
Feedback in the Non-Asymptotic Regime. IEEE Trans. Inf. Theory 57(8): 4903-4925 (2011) - [c9]Yury Polyanskiy, Sergio Verdú:
Relative entropy at the channel output of a capacity-achieving code. Allerton 2011: 52-59 - [c8]Yury Polyanskiy, Sergio Verdú:
Scalar coherent fading channel: Dispersion analysis. ISIT 2011: 2959-2963 - 2010
- [j1]Yury Polyanskiy, H. Vincent Poor, Sergio Verdú:
Channel coding rate in the finite blocklength regime. IEEE Trans. Inf. Theory 56(5): 2307-2359 (2010) - [c7]Yury Polyanskiy, Sergio Verdú:
Arimoto channel coding converse and Rényi divergence. Allerton 2010: 1327-1333 - [c6]Yury Polyanskiy, Sergio Verdú:
Channel dispersion and moderate deviations limits for memoryless channels. Allerton 2010: 1334-1339 - [c5]Yury Polyanskiy, H. Vincent Poor, Sergio Verdú:
Minimum energy to send k bits with and without feedback. ISIT 2010: 221-225 - [c4]Yury Polyanskiy, H. Vincent Poor, Sergio Verdú:
Variable-length coding with feedback in the non-asymptotic regime. ISIT 2010: 231-235
2000 – 2009
- 2009
- [c3]Yury Polyanskiy, H. Vincent Poor, Sergio Verdú:
Dispersion of Gaussian channels. ISIT 2009: 2204-2208 - [c2]Yury Polyanskiy, H. Vincent Poor, Sergio Verdú:
Dispersion of the Gilbert-Elliott channel. ISIT 2009: 2209-2213 - 2008
- [c1]Yury Polyanskiy, H. Vincent Poor, Sergio Verdú:
New channel coding achievability bounds. ISIT 2008: 1763-1767
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
