Encoding LDPC Codes Using the Triangular Factorization
Yoshio Kaji · IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences · 2006
An algorithm for encoding low-density parity check (LDPC) codes is investigated.The algorithm computes parity check symbols by solving a set of sparse equations, and the triangular factorization is employed to solve the equations efficiently.It is shown analytically and experimentally that the proposed algorithm is more efficient than the Richardson's encoding algorithm if the code has a small gap.