Utilising public information in Network Coding

  title={Utilising public information in Network Coding},
  author={S\oren Riis},
We show that an information network flow problem N in which n messages have to be sent to n destination nodes has a solution (that might utilise Network Coding) if and only if the directed graph GN (that appears by identifying each output node with its corresponding input node) hasguessing number ≥ n. The guessing number of a (directed) graph G is a new concept defined in terms of a simple cooperative game. We generalise this res ult so it applies to general information flow networks. We notice… CONTINUE READING