• Publications
  • Influence
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
Index Coding - An Interference Alignment Perspective
TLDR
We study the index coding problem from an interference alignment perspective providing new insights into, and generalizations of, previously known results. Expand
  • 88
  • 14
Retrospective Interference Alignment Over Interference Networks
TLDR
We show that retrospective interference alignment can be applied in interference networks consisting of distributed transmitters and receivers, where interference is contributed by multiple transmitters, each of whom can reconstruct only the part of the interference caused by themselves. Expand
  • 172
  • 13
  • PDF
Retrospective interference alignment
TLDR
We explore the possibility of achieving interference alignment with delayed CSIT in wireless networks in the absence of instantaneous channel state information at the transmitters. Expand
  • 78
  • 11
  • PDF
Index coding: An interference alignment perspective
TLDR
In this paper, we study the capacity of such a network from the perspective of interference alignment, and derive information theoretically optimal schemes for a class of networks. Expand
  • 110
  • 10
  • PDF
Network coding for three unicast sessions: Interference alignment approaches
TLDR
We propose interference alignment techniques, originally developed for wireless interference channels, for the problem of network coding across unicast sessions. Expand
  • 49
  • 5
  • PDF
Distributed Data Storage with Minimum Storage Regenerating Codes - Exact and Functional Repair are Asymptotically Equally Efficient
TLDR
We consider a set up where a file of size M is stored in n distributed storage nodes, using an (n,k) minimum storage regenerating (MSR) code that also allows efficient exact-repair of any failed node. Expand
  • 66
  • 2
  • PDF
Optimality of Orthogonal Access for One-Dimensional Convex Cellular Networks
  • H. Maleki, S. Jafar
  • Mathematics, Computer Science
  • IEEE Communications Letters
  • 9 May 2013
TLDR
We show that a greedy orthogonal access scheme achieves the sum degrees of freedom (DoF) of all one-dimensional (all nodes placed along a straight line) convex cellular networks (where cells are convex regions) when no channel knowledge is available at the transmitters except the knowledge of the network topology. Expand
  • 21
  • 2
  • PDF
Minimum Repair Bandwidth for Exact Regeneration in Distributed Storage
We consider a set up where a file of size $M$ is stored in $n$ distributed storage nodes, using an (n,k) minimum storage regenerating (MSR) code, i.e., a maximum distance separable (MDS) code thatExpand
  • 25
  • 1
  • PDF
SER Analysis and Power Allocation of OSTBC-OFDM With Channel Estimation Error
TLDR
In this paper, a simple closed-form formula for SER of OSTBC-OFDM, assuming Gaussian channel estimation error, is derived. Expand
  • 4
...
1
2
...