Publication

Network coding for undirected information exchange

Christina Fragouli, Suhas Diggavi
2009
Journal Articles

Abstract

We consider the information exchange problem where each in a set of terminals transmits information to all other terminals in the set, over an undirected network. We show that the design of only a single network code for multicasting is sufficient to achieve an arbitrary point in the achievable rate region. We also provide an alternative proof for the set of achievable rate tuples.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Network coding for undirected information exchange

Chat with Graph Search

Hitting with Probability One for Stochastic Heat Equations with Additive Noise

Dynamical system approach to navigation around obstacles

Reliable data-driven decision-making through optimal transport