linear encoding complexity 线性编码复杂度
encoding linear 线性编码
linear-time encoding 线性时间编码
linear time encoding 线性时间编码
ZS-GLDPC codes have linear encoding complexity, and can be decoded by the SPA iteratively.
该码具有线性编码复杂度,可采用和积译码算法实现迭代译码。
参考来源 - 基于交叉结构的信道编码技术研究·2,447,543篇论文数据，部分数据来源于NoteExpress
G matrix or H matrix can be linear block code encoding and decoding.
矩阵或H矩阵可以进行线性分组码的编码和译码。
To solve such a problem, this paper presents an improved PEG algorithm which can be encoded by the iterative encoding algorithm with linear coding complexity.
针对该问题，基于具有线性编码复杂度的迭代编码算法，提出了一种改进的PEG构造算法。
Linear octree encoding provides a effective way for tridimensional of objects. Algorithms for translation and rotation of linear octree were presented which have linear complexity in time.
线性八叉树编码是一种有效的表示三维物体的方法。给出了线性八叉树的平移和旋转算法，它们都有线性的时间复杂性。
应用推荐