Subtree decomposition for network coding

A subtree decomposition method for network coding is proposed in this paper. This approach enables derivation of tight bounds on the network code alphabet size, makes connections with convolutional codes transparent, allows specification of coding operations at network nodes without the knowledge of the overall network topology, and facilitates design of codes which can easily accommodate future changes in the network, such as addition of receivers and loss of links.