publication venue for
- Non-adaptive Quantitative Group Testing Using Irregular Sparse Graph Codes. 00:608-614. 2019
- Random Khatri-Rao-Product Codes for Numerically-Stable Distributed Matrix Multiplication. 00:253-259. 2019
- Universally Weakly Secure Coset Coding Schemes for Minimum Storage Regenerating (MSR) Codes. 2018-January:25-30. 2017
- Lattices over Eisenstein Integers for Compute-and-Forward. 33-40. 2012
- Optimal Information Updating based on Value of Information 2019
- Safe Intersection Management for Mixed Transportation Systems with Human-Driven and Autonomous Vehicles 2018
- On LDPC Decoding with Natural Redundancy 2017
- Stopping Set Elimination for LDPC Codes 2017
- Duality between Feature Selection and Data Clustering 2016
- Efficient Sampling for Better OSN Data Provisioning 2016
- Symmetry Reduction of Information Inequalities 2016
- Clustering by Multivariate Mutual Information under Chow-Liu Tree Approximation 2015
- Epidemic Spread Over Networks with Agent Awareness and Social Distancing 2015
- Exploring Connections between Sparse Fourier Transform Computation and Decoding of Product Codes 2015
- Joint Decoding of Content-Replication Codes for Flash Memories 2015
- Polar Codes for Secure Write-Efficient Memories 2015
- Spatially-Coupled Codes for Write-Once Memories 2015
- The ISO Problem: Decentralized Stochastic Control via Bidding Schemes 2015
- Online Learning for Demand Response 2015
- Coding for Secure Write-Efficient Memories 2014
- Concatenations of Polar Codes with Outer BCH Codes and Convolutional Codes 2014
- Online Scheduling for Energy Efficiency in Real-Time Wireless Networks 2014
- Two-User Degraded Broadcast Channel with Channel State Information at Transmitter and Message Side Information at Receivers 2014
- Repair-Efficient Distributed Storage Codes With Heterogeneous Reliability Requirements 2014
- An Analysis of the Joint Compute-and-Forward Decoder for the Binary-Input Two-Way Relay Channel 2013
- Generalized Cut-Set Bounds for Broadcast Networks 2013
- Optimal Decentralized Control in Unidirectional One-Step Delayed Sharing Pattern 2013
- Polar Codes are Optimal for Write-Efficient Memories 2013
- Truthful and Non-Monetary Mechanism for Direct Data Exchange 2013
- Incentives for P2P-Assisted Content Distribution: If You Can't Beat 'Em, Join 'Em 2012
- Learning in Linear Games over Networks 2012
- Multi-player Multi-armed Bandits: Decentralized Learning with IID Rewards 2012
- On a Critical Regime for Linear Finite-Buffer Networks 2012
- On the Performance of Random Block Codes over Finite-State Fading Channels 2012
- A Rate-Distortion Perspective on Multiple Decoding Attempts for Reed-Solomon Codes 2009
- Can Iterative Decoding for Erasure Correlated Sources be Universal? 2009
- Data Movement in Flash Memories 2009
- Neighbor Discovery in Mobile Ad Hoc Networks Using an Abstract MAC Layer 2009
- Broadcasting with Receiver Message Side Information: A Deterministic Approach 2008