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

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

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

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

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

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

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

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

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

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