This paper discusses the relation between network coding, (classical) algebraic coding, and network error correction. In the first part, we clarify the relation between network coding and algebraic coding. By showing that the Singleton bound in algebraic coding theory is a special case of the Maxflow Min-cut bound in network coding theory, we formally establish that linear multicast and its str...

Start with a directed acyclic graph (DAG) with a single sender and many receivers, where each receiver has k-edge connectivity from the sender. We assume that each edge has unit capacity, say, 1 bit/second. If our initial DAG does not meet this criterion, we can easily construct one that does: first, divide edge capacities by their greatest common divisor, then replace each c-capacity edge with...