Provided by: Institute of Electrical & Electronic Engineers
Date Added: Apr 2013
The encoding complexity of network coding for single multicast networks has been intensively studied from several aspects: e.g., the time complexity, the required number of encoding links, and the required field size for a linear code solution. However, these issues as well as the solvability are less understood for networks with multiple multicast sessions. Recently, Wang and Shroff showed that the solvability of networks with Two Unit-Rate Multicast Sessions (2-URMS) can be decided in polynomial time.