activity
20032009
most citedThe Secrecy Capacity of the MIMO Wiretap Channel

35 citations · 139 across the 8 of their papers we have counts for

collaborators
Showing 2009Show all

5 papers · 1 filter

cs.IT20096 cited

Near-Optimal Detection in MIMO Systems using Gibbs Sampling

Morten Hansen, Babak Hassibi, Alexandros G. Dimakis +1

In this paper we study a Markov Chain Monte Carlo (MCMC) Gibbs sampler for solving the integer least-squares problem. In digital communication the problem is equivalent to performi…

cs.IT20092 cited

Violating the Ingleton Inequality with Finite Groups

Wei Mao, Babak Hassibi

It is well known that there is a one-to-one correspondence between the entropy vector of a collection of n random variables and a certain group-characterizable vector obtained from…

math.PR200912 cited

Breaking through the Thresholds: an Analysis for Iterative Reweighted Minimization via the Grassmann Angle Framework

Weiyu Xu, M. Amin Khajehnejad, Salman Avestimehr +1

It is now well understood that minimization algorithm is able to recover sparse signals from incomplete measurements [2], [1], [3] and sharp recoverable sparsity threshold…

cs.IT200925 cited

Sparse Recovery of Positive Signals with Minimal Expansion

M. Amin Khajehnejad, Alexandros G. Dimakis, Weiyu Xu +1

We investigate the sparse recovery problem of reconstructing a high-dimensional non-negative sparse vector from lower dimensional linear measurements. While much work has focused o…

cs.IT200928 cited

Weighted Minimization for Sparse Recovery with Prior Information

M. Amin Khajehnejad, Weiyu Xu, Salman Avestimehr +1

In this paper we study the compressed sensing problem of recovering a sparse signal from a system of underdetermined linear equations when we have prior information about the proba…