Abstract
In this thesis, we consider generic linear network codes introduced by Li et al. We give a new algorithm for the construction of a generic linear network code on an acyclic network, which is an enhancement of a previously proposed algorithm by Yeung et al. for the construction of a generic linear network code. We also obtain an improved lower bound on the size of the finite field from which the source symbols are taken.