Superposition coding in the combination network
Henry P. Romero, Mahesh K. Varanasi · 2016
We present an inner bound for the combination network based on superposition coding and partial interference decoding. This inner bound is tight in the three-user and K-user symmetric cases, where capacity has been previously characterized. However, unlike previous achievability schemes, the scheme presented herein does not require network coding. By avoiding network coding, our inner bound has fewer extraneous parameters. Moreover, it contains the intersection of polymatroids, one for each receiver, a structure that may be more amenable to further analysis than the previous inner bounds for the combination network.