| Publication | Date of Publication | Type |
|---|
Bounds on the density of smooth lattice coverings
Journal d'Analyse Mathématique | 2025-10-09 | Paper |
Memory complexity of estimating entropy and mutual information
IEEE Transactions on Information Theory | 2025-07-11 | Paper |
The strong data processing inequality under the heat flow
IEEE Transactions on Information Theory | 2025-07-11 | Paper |
Blind modulo analog-to-digital conversion
IEEE Transactions on Signal Processing | 2024-09-12 | Paper |
| Bounds on the density of smooth lattice coverings | 2023-11-08 | Paper |
Strong Data Processing Constant Is Achieved by Binary Inputs
IEEE Transactions on Information Theory | 2022-05-30 | Paper |
A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
An Upgrading Algorithm With Optimal Power Law
IEEE Transactions on Information Theory | 2022-02-17 | Paper |
New bounds on the density of lattice coverings
Journal of the American Mathematical Society | 2021-11-04 | Paper |
Information-Distilling Quantizers
IEEE Transactions on Information Theory | 2021-07-22 | Paper |
Blind Unwrapping of Modulo Reduced Gaussian Vectors: Recovering MSBs From LSBs
IEEE Transactions on Information Theory | 2021-07-22 | Paper |
Multi-reference alignment in high dimensions: sample complexity and phase transition
SIAM Journal on Mathematics of Data Science | 2021-07-06 | Paper |
| Characterizing the performance of wireless communication architectures via basic Diophantine approximation bounds | 2021-03-22 | Paper |
A Note on the Probability of Rectangles for Correlated Binary Strings
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
A Lower Bound on the Expected Distortion of Joint Source-Channel Coding
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Performance Analysis and Optimal Filter Design for Sigma-Delta Modulation via Duality With DPCM
IEEE Transactions on Information Theory | 2019-01-28 | Paper |
Integer-Forcing Source Coding
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Cyclic-Coded Integer-Forcing Equalization
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
On the Robustness of Lattice Interference Alignment
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
The Approximate Sum Capacity of the Symmetric Gaussian <inline-formula> <tex-math notation="TeX">$K$ </tex-math></inline-formula>-User Interference Channel
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
A Simple Proof for the Existence of “Good” Pairs of Nested Lattices
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Precoded Integer-Forcing Universally Achieves the MIMO Capacity to Within a Constant Gap
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Mutual Information Bounds via Adjacency Events
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Minimum MS. E. Gerber’s Lemma
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
An upper bound on the sizes of multiset-union-free families
SIAM Journal on Discrete Mathematics | 2016-05-26 | Paper |
