Infoscience

Conference paper

Network coding as a coloring problem (Invited paper)

We consider a multicast configuration with two sources, and translate the network code design problem to vertex coloring of an appropriately defined graph. This observation enables to derive code design algorithms and alphabet size bounds, as well as establish a connection with a number of well-known results from discrete mathematics that increase our insight in the different trade-offs possible for network coding.

    Reference

    • ARNI-CONF-2007-001

    Record created on 2007-02-01, modified on 2016-08-08

Related material

Contacts

EPFL authors