Efficient Linear Time Encoding for LDPC Codes

[1]  Robert G. Gallager,et al.  Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.

[2]  Zongwang Li,et al.  Efficient encoding of quasi-cyclic low-density parity-check codes , 2006, IEEE Trans. Commun..

[3]  Alex J. Grant,et al.  Reversible Low-Density Parity-Check Codes , 2009, IEEE Transactions on Information Theory.

[4]  Rüdiger L. Urbanke,et al.  Efficient encoding of low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[5]  Rüdiger L. Urbanke,et al.  Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[6]  Sarah J. Johnson,et al.  A family of irregular LDPC codes with low encoding complexity , 2003, IEEE Communications Letters.

[7]  Kazuo Murota,et al.  Matrices and Matroids for Systems Analysis , 2000 .

[8]  Jose M. F. Moura,et al.  Efficient encoding of cycle codes: a graphical approach , 2003, The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003.

[9]  J. H. van Lint,et al.  Introduction to Coding Theory , 1982 .

[10]  José M. F. Moura,et al.  Linear Time Encoding of LDPC Codes , 2008, IEEE Transactions on Information Theory.

[11]  William E. Ryan,et al.  Design of efficiently encodable moderate-length high-rate irregular LDPC codes , 2004, IEEE Transactions on Communications.

[12]  David J. C. MacKay,et al.  Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.

[13]  Tomoharu Shibuya,et al.  Generalization of Lu's linear time encoding algorithm for LDPC codes , 2012, 2012 International Symposium on Information Theory and its Applications.