RA codes have a natural linear-time encoding algorithm.
RA码具有线性时间编码算法。
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.
线性八叉树编码是一种有效的表示三维物体的方法。给出了线性八叉树的平移和旋转算法，它们都有线性的时间复杂性。
Focusing on the problem that existing linear dispersion (LD) space-time codes have a high encoding and decoding complexity, a type of orthogonal linear dispersion (OLD) space-time codes is proposed.
针对多输入多输出系统中现有的线性分散(LD)空时码编、解码复杂度高的问题，提出了一类正交线性分散(old)空时编码。
The encoding complexity of LDPC codes length n seems indeed to be of order n2, the dissertation study the coding scheme with linear time complexity.
针对LDPC码通用编码算法的复杂度与码长的平方成正比的问题，重点研究了LDPC码的快速编码方法，总结出了使LDPC码能够达到线性编码的途径。
The encoding complexity of LDPC codes length n seems indeed to be of order n2, the dissertation study the coding scheme with linear time complexity.
针对LDPC码通用编码算法的复杂度与码长的平方成正比的问题，重点研究了LDPC码的快速编码方法，总结出了使LDPC码能够达到线性编码的途径。
应用推荐