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.%单源最大可解线性网络编码可以提高网络容量,但没有考虑边失效或点失效的情况.为此,利用贪心算法,基于启发式规则,提出一种静态最大可解网络编码的构造方法.该方法在每次迭代时,通过向构造的编码向量中加入已有的向量,并删除使用过的边,提高网络传输速率.实验结果证明,该方法在网络容量方面可以获得较大的增益.
展开▼
