·2,447,543篇论文数据，部分数据来源于NoteExpress
This algorithm also adopts the zero-tree structure, but distinguished from its origin algorithm, it takes not only the zero-tree but also the rest trees as a set.
该算法也采用的零树的结构，但它的起源算法区别于，它需要不仅零树也作为一组的其余部分树。
This algorithm used the data of tree structure, and could more reasonably the skipping relations of the non-zero elements in the rows and lines of the sparse check matrix.
该算法采用人们熟悉的树型数据结构，可以较为合理地表示稀疏校验矩阵中行与列中非零元素的跳转关系。
应用推荐