Chris Freiling

Learn More
— The coding capacity of a network is the supremum of ratios is the source message dimension and £ is the maximum edge dimension. The coding capacity is referred to as routing capacity in the case when only routing is allowed. A network is said to achieve its capacity if there is some fractional equals the capacity. The routing capacity is known to be(More)
— The well-studied Vámos matroid has provided a wealth of interesting theoretical results in matroid theory. We use the Vámos matroid to construct a new network, which we call the Vámos network. We then exploit the Vámos network to answer in the negative the open question as to whether Shannon-type information inequalities are in general sufficient for(More)
— We define a class of networks, called matroidal networks, which includes as special cases all scalar-linearly solv-able networks, and in particular solvable multicast networks. We then present a method for constructing matroidal networks from known matroids. We specifically construct networks that play an important role in proving results in the(More)
  • 1