We propose an efficient encoding algorithm for the binary and non-binary low-density parity-check codes. This algorithm transforms the parity part of the parity-check matrix into a block triangular matrix with low weight diagonal submatrices by row and column permutations in the preprocessing stage. This algorithm determines the parity part of a codeword by block back-substitution to reduce the encoding complexity in the encoding stage. Numerical experiments show that this algorithm has a lower encoding complexity than existing encoding algorithms. Moreover, we show that this algorithm encodes the non-binary cycle codes in linear time.
翻译:我们为二进制和非二进制低密度对等检查代码建议一个高效的编码算法。 这个算法将对等检查矩阵的对等部分转换成三边块矩阵,在预处理阶段按行和列排列低重量对角次矩阵。 这个算法通过块后置替代来决定编码词的对等部分, 以减少编码阶段的编码复杂性。 数字实验显示, 这个算法比现有的编码算法复杂得多。 此外, 我们显示, 这个算法在线性时间将非二进制周期代码编码编码。