当复杂线性网络某一支路的参数变化时，应用这种方法分析该支路的状态是比较简便的。
It is convenient to use this method for analysing the state of a branch in case the parameters of the branch of the complex linear network undergo a change.
本文主要研究了最大可解线性网络编码的计算复杂性与构造方法。
The thesis focuses on two facets of maximum decodable linear network coding: the computing complexity and the constructing method.
应用推荐