Loading...
conference paper
Network coding as a coloring problem (Invited paper)
2004
Proceedings
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.
Use this identifier to reference this record
Loading...
Name
network_1.pdf
Access type
openaccess
Size
107.85 KB
Format
Adobe PDF
Checksum (MD5)
c7e648e1782f3f2ea915c054e2f7eeeb