| Publication | Date of Publication | Type |
|---|
Fundamental limits of topology-aware shared-cache networks
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
Multi-access distributed computing
IEEE Transactions on Information Theory | 2024-07-22 | Paper |
Multi-user linearly-separable distributed computing
IEEE Transactions on Information Theory | 2024-07-19 | Paper |
Fundamental Limits of Combinatorial Multi-Access Caching
IEEE Transactions on Information Theory | 2024-03-18 | Paper |
Unselfish Coded Caching Can Yield Unbounded Gains Over Selfish Caching
IEEE Transactions on Information Theory | 2024-03-14 | Paper |
Resolving the Feedback Bottleneck of Multi-Antenna Coded Caching
IEEE Transactions on Information Theory | 2022-07-13 | Paper |
| Multi-User Linearly-Separable Distributed Computing | 2022-06-22 | Paper |
Fundamental Limits of Wireless Caching Under Mixed Cacheable and Uncacheable Traffic
IEEE Transactions on Information Theory | 2021-07-23 | Paper |
Optimal DoF of the K-User Broadcast Channel With Delayed and Imperfect Current CSIT
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
Full Coded Caching Gains for Cache-Less Users
IEEE Transactions on Information Theory | 2020-12-04 | Paper |
Fundamental Limits of Coded Caching With Multiple Antennas, Shared Caches and Uncoded Prefetching
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
Performance-Complexity Analysis for MAC ML-Based Decoding With User Selection
IEEE Transactions on Signal Processing | 2019-02-07 | Paper |
Fundamental Limits of Cache-Aided Wireless BC: Interplay of Coded-Caching and CSIT Feedback
(available as arXiv preprint) | 2017-08-25 | Paper |
High-SNR Analysis of Outage-Limited Communications With Bursty and Delay-Limited Information
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Space–Time Codes Achieving the DMD Tradeoff of the MIMO-ARQ Channel
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
DMT Optimality of LR-Aided Linear Decoders for a General Class of Channels, Lattice Designs, and System Models
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Large Families of Asymptotically Optimal Two-Dimensional Optical Orthogonal Codes
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Achieving a Vanishing SNR Gap to Exact Lattice Decoding at a Subexponential Complexity
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Sphere Decoding Complexity Exponent for Decoding Full-Rate Codes Over the Quasi-Static MIMO Channel
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Toward the Performance Versus Feedback Tradeoff for the Two-User MISO Broadcast Channel
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
On the Two-User MISO Broadcast Channel With Alternating CSIT: A Topological Perspective
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Explicit Space–Time Codes Achieving the Diversity–Multiplexing Gain Tradeoff
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Perfect Space–Time Codes for Any Number of Antennas
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
New Constructions and Bounds for 2-D Optical Orthogonal Codes
Sequences and Their Applications - SETA 2004 | 2008-03-14 | Paper |
