# Embedded Index Coding

## TL;DR

Embedded index coding (EIC) is a new framework for distributed systems where nodes both send and receive data, with practical algorithms and bounds for efficient communication in distributed storage and computation.

## Contribution

The paper introduces embedded index coding, characterizes its communication costs, and proposes task-based EIC with practical algorithms for real-world distributed systems.

## Key findings

- Characterizations and bounds on communication costs of EIC
- Task-based EIC is more computationally tractable
- Heuristic algorithms perform well empirically

## Abstract

Motivated by applications in distributed storage and distributed computation, we introduce embedded index coding (EIC). EIC is a type of distributed index coding in which nodes in a distributed system act as both senders and receivers of information. We show how embedded index coding is related to index coding in general, and give characterizations and bounds on the communication costs of optimal embedded index codes. We also define task-based EIC, in which each sending node encodes and sends data blocks independently of the other nodes. Task-based EIC is more computationally tractable and has advantages in applications such as distributed storage, in which senders may complete their broadcasts at different times. Finally, we give heuristic algorithms for approximating optimal embedded index codes, and demonstrate empirically that these algorithms perform well.