| On the Role of Channel Capacity in Learning Gaussian Mixture Models. | 0 | 0.34 | 2022 |
| Strong Data Processing Constant Is Achieved by Binary Inputs | 0 | 0.34 | 2022 |
| On The Memory Complexity of Uniformity Testing. | 0 | 0.34 | 2022 |
| Deterministic Finite-Memory Bias Estimation. | 0 | 0.34 | 2021 |
| An Upgrading Algorithm With Optimal Power Law | 0 | 0.34 | 2021 |
| Binary Maximal Correlation Bounds And Isoperimetric Inequalities Via Anti-Concentration | 0 | 0.34 | 2021 |
| A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels | 0 | 0.34 | 2021 |
| Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs From LSBs | 0 | 0.34 | 2021 |
| Multi-Reference Alignment In High Dimensions: Sample Complexity And Phase Transition | 1 | 0.36 | 2021 |
| A Note on the Probability of Rectangles for Correlated Binary Strings | 0 | 0.34 | 2020 |
| A Lower Bound on the Expected Distortion of Joint Source-Channel Coding | 1 | 0.37 | 2020 |
| Binary Hypothesis Testing with Deterministic Finite-Memory Decision Rules | 0 | 0.34 | 2020 |
| Blind Unwrapping Of Modulo Reduced Gaussian Vectors: Recovering Msbs From Lsbs | 0 | 0.34 | 2019 |
| Above the Nyquist Rate, Modulo Folding Does Not Hurt | 2 | 0.39 | 2019 |
| A Lower Bound On The Expected Distortion Of Joint Source-Channel Coding | 0 | 0.34 | 2019 |
| Almost Optimal Scaling Of Reed-Muller Codes On Bec And Bsc Channels | 0 | 0.34 | 2018 |
| A Modulo-Based Architecture for Analog-to-Digital Conversion. | 3 | 0.40 | 2018 |
| Entropy Under Additive Bernoulli And Spherical Noises | 1 | 0.35 | 2018 |
| Information-Distilling Quantizers. | 0 | 0.34 | 2018 |
| Ozarow- Type Outer Bounds for Memoryless Sources and Channels. | 1 | 0.35 | 2018 |
| How to quantize n outputs of a binary symmetric channel to n - 1 bits? | 0 | 0.34 | 2017 |
| Information-distilling quantizers. | 0 | 0.34 | 2017 |
| Mutual Information Bounds via Adjacency Events. | 1 | 0.36 | 2016 |
| Diophantine approximation for network information theory: A survey of old and new results. | 0 | 0.34 | 2016 |
| Minimum MS. E. Gerber’s Lemma | 0 | 0.34 | 2015 |
| Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality With DPCM | 0 | 0.34 | 2015 |
| On compute-and-forward with feedback | 0 | 0.34 | 2015 |
| Dictatorship is the Most Informative Balanced Function at the Extremes. | 0 | 0.34 | 2015 |
| Subset-universal lossy compression | 0 | 0.34 | 2015 |
| Mutual Information Bounds via Adjacency Events | 0 | 0.34 | 2015 |
| The Approximate Sum Capacity of the Symmetric Gaussian $K$ -User Interference Channel. | 23 | 0.96 | 2014 |
| Bounding techniques for the intrinsic uncertainty of channels | 1 | 0.35 | 2014 |
| Is There a Proficiency-Universal Language? | 0 | 0.34 | 2014 |
| An Upper Bound on the Sizes of Multiset-Union-Free Families | 2 | 0.38 | 2014 |
| Precoded Integer-Forcing Equalization Universally Achieves the MIMO Capacity up to a Constant Gap | 1 | 0.35 | 2013 |
| On the Robustness of Lattice Interference Alignment | 13 | 0.77 | 2013 |
| Integer-Forcing source coding | 6 | 0.62 | 2013 |
| Successive integer-forcing and its sum-rate optimality | 31 | 1.20 | 2013 |
| The approximate sum capacity of the symmetric Gaussian K-user interference channel | 5 | 0.45 | 2012 |
| Cyclic-Coded Integer-Forcing Equalization | 9 | 0.56 | 2012 |
| The Compute-And-Forward Transform | 4 | 0.42 | 2012 |
| A simple proof for the existence of “good” pairs of nested lattices | 11 | 0.65 | 2012 |
| Interference Alignment At Finite Snr For Time-Invariant Channels | 0 | 0.34 | 2011 |
| Interference Alignment at Finite SNR | 5 | 0.60 | 2011 |
