On the representability of integer polymatroids: Applications in linear code construction

Abstract

It has been shown that there is a duality between the linear network coding solution and the entropic vectors induced by collection of subspaces in a vector space over a finite field (dubbed linearly constructed entropic vectors). The region of all linearly constructed vectors, coincides with the set of all representable polymatroids. For any integer polymatroid, there is an associated matroid, which uniquely identifies the polymatroid. We conjecture that the representability of the underlying matroid is a sufficient condition for integer polymatroids to be linearly representable. We prove that the conjecture holds for representation over real numbers. Furthermore, we show that any real-valued submodular function (such as Shannon entropy) can be approximated (arbitrarily close) by an integer polymatroid.