摘要：In this paper, according to Dougherty et al.’s method, we construct a matroidal network associated with vector matroid . Then we use Ingleton inequality and Zhang-Yeung non-Shannon-type information inequality respectively to compute upper bounds on coding capacity of the constructed matroidal network. Finally, We prove that the coding capacity of the matroidal network associated with is at most .
