So far, studies on coherent linear error-correcting network (LEN) codes are restricted to acyclic networks. In this thesis, we show that existing fundamental results and concepts can be extended from acyclic networks to cyclic networks by changing alphabet symbols from fields to commutative rings. This thesis consists of four main parts as follows.
