An algebraic method for constructing efficiently encodable irregular LDPC codes
Hachiro Fujita, Maki Ohata, K. Sakaniwa · 2005
In this paper we propose an algebraic construction of efficiently encodable irregular LDPC codes. The proposed irregular LDPC codes have not only an efficient encoding algorithm but also guaranteed minimum distances. Simulation results show that the proposed codes perform well compared to randomly constructed irregular LDPC codes