Approximate Construction of Maximum Decodable Linear Network Coding for Single Source
Guanqun Liu · Jisuanji gongcheng · 2010
Based on the linear network coding,this paper proposes the maximum decodable linear network coding.It proves that whether there exists a maximum decodable linear network code for a given network is NP-hard,and gives an approximate polynomial algorithm with a heuristic rule to construct such a network code.Simulation proves that the maximum decodable linear network coding helps to gain better network capacity.