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.


Publié dans:
Proceedings
Présenté à:
IEEE Annual Conference on Information Sciences and Systems (CISS 2004), Princeton, NJ, USA, March 2004
Année
2004
Laboratoires:


Note: Le statut de ce fichier est: Anyone


 Notice créée le 2007-02-01, modifiée le 2020-07-30

n/a:
Télécharger le document
PDF

Évaluer ce document:

Rate this document:
1
2
3
 
(Pas encore évalué)