Construction of Static Maximum Decodable Network Coding
Jian Huang, Songtao Liang · Jisuanji gongcheng · 2012
Maximum decodable linear network code can improve the network capacity,but there are problems in the situation of edge false or node false.Based on greedy algorithm and a heuristic rule,this paper proposes an algorithm to construct the static maximum network coding.In each iteration process,it adds an existing vector,and deletes the edge used.Simulation result shows that the proposed algorithm can obtain great gain in network capacity.