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.


Published in:
In Proceedings
Presented at:
IEEE Annual Conference on Information Sciences and Systems (CISS 2004), Princeton, NJ, USA, March 2004
Year:
2004
Laboratories:




 Record created 2007-02-01, last modified 2018-01-27

External link:
Download fulltext
n/a
Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)