A combinatorial study of linear deterministic relay networks

Abstract

The linear deterministic network model of Avestimehr, Diggavi and Tse has attracted attention because it captures certain physical aspects of wireless communication such as broadcasting and interference but is discrete and deterministic like traditional wireline network models. We study the unicast problem for this network model using results from matroid theory and submodular optimization, and we provide deterministic and polynomial-time coding schemes that can achieve the capacity.