16 citations · 30 across the 12 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2014★ 4 cited
Graph Guessing Games and non-Shannon Information Inequalities
Rahil Baber, Demetres Christofides, Anh N. Dang +2
Guessing games for directed graphs were introduced by Riis for studying multiple unicast network coding problems. In a guessing game, the players toss generalised dice and can see…
cs.IT2010★ 1 cited
Max-Flow Min-Cut Theorems for Multi-User Communication Networks
Soren Riis, Maximilien Gadouleau
The paper presents four distinct new ideas and results for communication networks: 1) We show that relay-networks (i.e. communication networks where different nodes use the same co…
cs.IT2010★ 1 cited
Graph-theoretical Constructions for Graph Entropy and Network Coding Based Communications
Maximilien Gadouleau, Soren Riis
The guessing number of a directed graph (digraph), equivalent to the entropy of that digraph, was introduced as a direct criterion on the solvability of a network coding instance.…