This paper deals with matroids on the edge set of a network. Through the structure of edge-disjoint paths, a single-source network is associated with a network matroid, which turns out to be representable. A linear network code on an acyclic network assigns a coding vector to every edge. The linear independence among coding vectors naturally induces a matroid. It is shown that every independent set in the matroid so induced is also independent in the network matroid. Moreover, the two matroids coincide with each other if and only if the linear network code is a generic one. Furthermore, every representation for the network matroid of an acyclic network induces a generic linear network code. This offers a new characterization of generic linear network codes. For the network matroid of a cyclic network, an algorithm for finding a representation is also derived through the association with an acyclic network.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.