Chris Freiling

Learn More
The following typographical errors appeared in this publication: • On page 1959, column 2, in the 2nd line of Step 3, the equality g(x) = n 1 should be g(ˆ x) = n 1. • On page 1962, column 1, in the 6th line after Table IV, the period after " Finally " should be a comma. • On page 1965, column 2, in the 1st line before Section VII, the text " that " should(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)
2 Matroid Theory 3 This paper explores the connection between network coding and matroid theory, 4 a branch of mathematics that generalizes linear algebra and graph theory. ABSTRACT | Networks derived from matroids have played a 7 fundamental role in proving theoretical results about the limits 8 of network coding. In this tutorial paper, we review many(More)