该算法采用人们熟悉的树型数据结构，可以较为合理地表示稀疏校验矩阵中行与列中非零元素的跳转关系。

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.

youdao

该算法采用人们熟悉的树型数据结构，可以较为合理地表示稀疏校验矩阵中行与列中非零元素的跳转关系。

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.

youdao