• Publications
  • Influence
Interference Alignment and Degrees of Freedom of the $K$-User Interference Channel
TLDR
We have shown that with perfect channel knowledge the user interference channel has (almost surely) degrees of freedom when the channel coefficients are time-varying and are generated from a continuous distribution. Expand
  • 2,695
  • 379
  • PDF
A Distributed Numerical Approach to Interference Alignment and Applications to Wireless Interference Networks
TLDR
In this work, we provide examples of iterative algorithms that utilize the reciprocity of wireless networks to achieve interference alignment with only local channel knowledge at each node. Expand
  • 810
  • 188
  • PDF
Approaching the Capacity of Wireless Networks through Distributed Interference Alignment
TLDR
We provide examples of iterative algorithms that utilize the reciprocity of wireless networks to achieve interference alignment with only local channel knowledge at each node. Expand
  • 772
  • 139
  • PDF
Interference Alignment and Spatial Degrees of Freedom for the K User Interference Channel
TLDR
We show that the sum capacity of the K user frequency selective (or time-varying) interference channel is C(SNR) = (K/2) log( SNR) +o(log(SNr)) meaning that the channel has a total of K/2 degrees of freedom per orthogonal time and frequency dimension. Expand
  • 601
  • 111
  • PDF
Interference Alignment and the Degrees of Freedom of Wireless $X$ Networks
TLDR
We explore the degrees of freedom of M times N user wireless X networks, i.e., networks of M transmitters and N receivers where every transmitter has an independent message for every receiver. Expand
  • 402
  • 50
  • PDF
Interference Alignment With Asymmetric Complex Signaling—Settling the Høst-Madsen–Nosratinia Conjecture
TLDR
It has been conjectured by Hø-Madsen and Nosratinia that complex Gaussian interference channels with constant channel coefficients have only one degree-of-freedom regardless of the number of users. Expand
  • 190
  • 21
  • PDF
Degrees of Freedom of Wireless Networks With Relays, Feedback, Cooperation, and Full Duplex Operation
TLDR
We find the degrees of freedom of a network with S source nodes, R relay nodes, and D destination nodes, with random time-varying/frequency-selective channel coefficients and global channel knowledge at all nodes. Expand
  • 233
  • 19
  • PDF
Bounds on the Size of Locally Recoverable Codes
TLDR
In a locally recoverable or repairable code, any symbol of a codeword can be recovered by reading only a small (constant) number of other symbols. Expand
  • 101
  • 18
Asymptotic Interference Alignment for Optimal Repair of MDS Codes in Distributed Storage
TLDR
The high repair bandwidth cost of (<i>n</i>,<i>k</i>) maximum distance separable (MDS) erasure codes has motivated a new class of codes that can reduce repair bandwidth over that of conventional MDS codes. Expand
  • 177
  • 14
  • PDF
Repair optimal erasure codes through hadamard designs
TLDR
We use Hadamard matrices to construct the first explicit 2-parity MDS storage code with optimal repair properties for all single node failures, including the parity nodes. Expand
  • 153
  • 14
  • PDF