Abstract
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. Copyright © 2006 The Institute of Electronics, Information and Communication Engineers.
Author supplied keywords
Cite
CITATION STYLE
Kaji, Y. (2006). Encoding LDPC codes using the triangular factorization. In IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Vol. E89-A, pp. 2510–2518). Institute of Electronics, Information and Communication, Engineers, IEICE. https://doi.org/10.1093/ietfec/e89-a.10.2510
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
