We introduce the concept of “coded computing”, a novel computing paradigm that utilizes
coding theory to effectively inject and leverage data/computation redundancy to mitigate …

A new inner bound on the capacity region of the general index coding problem is
established. Unlike most existing bounds that are based on graph theoretic or algebraic …

We study a multi-access variant of the popular coded caching framework, which consists of a
central server with a catalog of N files, K caches with limited memory M, and K users such …

Index coding is a canonical problem in network information theory that studies the
fundamental limit and optimal coding schemes for broadcasting multiple messages to …

The capacity of caching networks has received considerable attention in the past few years.
A particularly studied setting is the case of a single server (eg, a base station) and multiple …

Index coding and coded caching are two active research topics in information theory with
strong ties to each other. Motivated by the multi-access coded caching problem, we study a …

Index coding studies multiterminal source-coding problems where a set of receivers are
required to decode multiple (possibly different) messages from a common broadcast, and …

The capacity of caching networks has received considerable attention in the past few years.
A particularly studied setting is the shared link caching network, in which a single source …

Over the decades, multiple approaches have been proposed to solve convex programs. The
development of interior-point methods allowed solving a more general set of convex …

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 …