270 citations · 835 across the 84 of their papers we have counts for
10 papers · 1 filter
From Centralized to Decentralized Coded Caching
Yitao Chen, Karthikeyan Shanmugam, Alexandros G. Dimakis
We consider the problem of designing decentralized schemes for coded caching. In this problem there are users each caching files out of a library of total files. The qu…
Coded Caching with Linear Subpacketization is Possible using Ruzsa-Szeméredi Graphs
Karthikeyan Shanmugam, Antonia M. Tulino, Alexandros G. Dimakis
Coded caching is a problem where encoded broadcasts are used to satisfy users requesting popular files and having caching capabilities. Recent work by Maddah-Ali and Niesen showed…
An Efficient Multiple-Groupcast Coded Multicasting Scheme for Finite Fractional Caching
Mingyue Ji, Karthikeyan Shanmugam, Giuseppe Vettigli +3
Coded multicasting has been shown to improve the caching performance of content delivery networks with multiple caches downstream of a common multicast link. However, the schemes t…
Finite Length Analysis of Caching-Aided Coded Multicasting
Karthikeyan Shanmugam, Mingyue Ji, Antonia M. Tulino +2
In this work, we study a noiseless broadcast link serving users whose requests arise from a library of files. Every user is equipped with a cache of size files each. It…
On Approximating the Sum-Rate for Multiple-Unicasts
Karthikeyan Shanmugam, Megasthenis Asteris, Alexandros G. Dimakis
We study upper bounds on the sum-rate of multiple-unicasts. We approximate the Generalized Network Sharing Bound (GNS cut) of the multiple-unicasts network coding problem with …
Graph Theory versus Minimum Rank for Index Coding
Karthikeyan Shanmugam, Alexandros G. Dimakis, Michael Langberg
We obtain novel index coding schemes and show that they provably outperform all previously known graph theoretic bounds proposed so far. Further, we establish a rather strong negat…
Bounding Multiple Unicasts through Index Coding and Locally Repairable Codes
Karthikeyan Shanmugam, Alexandros G. Dimakis
We establish a duality result between linear index coding and Locally Repairable Codes (LRCs). Specifically, we show that a natural extension of LRCs we call Generalized Locally Re…
A Repair Framework for Scalar MDS Codes
Karthikeyan Shanmugam, Dimitris S. Papailiopoulos, Alexandros G. Dimakis +1
Several works have developed vector-linear maximum-distance separable (MDS) storage codes that min- imize the total communication cost required to repair a single coded symbol afte…
Index Coding Problem with Side Information Repositories
Karthikeyan Shanmugam, Alexandros G. Dimakis, Giuseppe Caire
To tackle the expected enormous increase in mobile video traffic in cellular networks, an architecture involving a base station along with caching femto stations (referred to as he…
Local Graph Coloring and Index Coding
Karthikeyan Shanmugam, Alexandros G. Dimakis, Michael Langberg
We present a novel upper bound for the optimal index coding rate. Our bound uses a graph theoretic quantity called the local chromatic number. We show how a good local coloring can…