Study of efficient encoding of LDPC codes
Wang Xin-meii · Journal of Xidian University · 2004
The efficient encoding problem of LDPC codes is studied. Based on the decoding algorithm for LDPC codes under erasure channels and the sparseness of their parity-check matrices, an efficient encoding method for LDPC codes is described and further explained via two classes of linearly encode-able codes. The practical implementation of this method is discussed in detail and two code construction approaches are presented. Simulation results show that the LDPC codes constructed here work no worse than random ones under AWGN channels.