linear encoding complexity 线性编码复杂度
LPE Linear Predictive Encoding 线性预测编码
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
This paper firstly overviews the efficient encoding of LDPC codes, based on which we proposes a linear encoding for UEP.
首先回顾了LDPC码的有效编码，然后在此基础上提出了一种应用于不等错误保护的线性复杂度编码方法。
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构造算法。
应用推荐