Network coding is emerging as a "hot topic" in communications and networking, with many fundamental results appearing rapidly since the publication of the seminal paper by Ahlswede, Cai, Li, and Yeung in the IEEE Transactions on Information Theory in 2000. The celebrated min-cut, max-flow theorem states that a source node can send a commodity through a network to a sink node at the rate determined by the min-cut separating the source and the sink. The above paper, surprisingly, showed that by re-encoding at nodes, the min-cut rate can also be achieved when multicasting to several sinks. Perhaps just as importantly, recent results have shown that network coding can improve the security and robustness of networks.
The broad interest in this topic, which has attracted researchers from across the spectrum from coding and networking to computer science, is a result of both the interdisciplinary nature of the problems, and the potential impact that network coding might have on the operation of future networks.
This workshop will consist of talks by leading researchers in network coding. The aim of the workshop will be the dissemination of the most recent breakthroughs, and an exchange of ideas to further advance the area.