Abinesh Ramakrishnan

Learn More
We propose interference alignment techniques, originally developed for wireless interference channels, for the problem of network coding across unicast sessions. We describe two general approaches (namely, coding at the edge or in the middle of the network) and one specific example of each approach (namely, symbol extension method and ergodic alignment,(More)
We consider the problem of network coding across three unicast sessions over a directed acyclic graph, when each session has min-cut one. Previous work by Das et al. adapted a precoding-based interference alignment technique, originally developed for the wireless interference channel, specifically to this problem. We refer to this approach as(More)
We consider a network with several users trying to access a database of files stored at a server through a shared link. Each user is equipped with a cache, where files can be prefetched according to a caching policy which is mainly based on the popularities of the files. Coded caching tries to exploit coding opportunities created by cooperative caching and(More)
We consider the problem of network coding across three unicast sessions over a directed acyclic graph, where the sender and receiver of each unicast session are both connected to the network via a single edge of unit capacity. We consider a network model in which the middle of the network can only perform random linear network coding, and restrict our(More)
We characterize the degrees of freedom (DoF) of multiple-input and multiple-output (MIMO) interference channels with rank-deficient channel matrices. For the two-user rank-deficient MIMO interference channel, we provide a tight outer bound to show that the previously known achievable DoF in the symmetric case is optimal and generalize the result to fully(More)
We characterize the Degrees of Freedom (DoF) of MIMO interference channels with rankdeficient channel matrices. For the 2-user rank deficient MIMO interference channel, we provide a tight outer bound to show that the previously known achievable DoF in the symmetric case is optimal and generalize the result to fully asymmetric settings. For the K-user rank(More)
We consider the interference channel with K transmitters and K receivers all having a single antenna, wherein the K × K transfer matrix representing this channel has rank D (D <; K) . The degrees of freedom (DoF) of such channels are not known as the rank deficiency in the transfer matrix creates algebraic dependencies between the channel(More)
We consider the benefits brought by network coding in Information-Centric Networks (ICNs) in the case of a video streaming application. Network coding, when combined with ICN, allows a data transfer session to use multiple sources for the content seamlessly. It permits the client fetching the content to use multiple interfaces at the same time in an(More)
  • 1