Improved regular and semi-random rate-compatible low-density parity-check codes with short block lengths
暂无分享,去创建一个
Salam A. Zummo | Mohamed Adnan Landolsi | Maan A. Kousa | Shaikh F. Zaheer | M. Landolsi | S. Zummo | M. Kousa
[1] Evangelos Eleftheriou,et al. Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.
[2] R. Morelos-Zaragoza. The art of error correcting coding , 2002 .
[3] Robert C. Williamson,et al. Loop removal from LDPC codes , 2003, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674).
[4] Rüdiger L. Urbanke,et al. Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.
[5] D.J.C. MacKay,et al. Good error-correcting codes based on very sparse matrices , 1997, Proceedings of IEEE International Symposium on Information Theory.
[6] Steven W. McLaughlin,et al. Rate-compatible puncturing of low-density parity-check codes , 2004, IEEE Transactions on Information Theory.
[7] Sae-Young Chung,et al. On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.
[8] Rüdiger L. Urbanke,et al. Efficient encoding of low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.
[9] Daniel A. Spielman,et al. Improved low-density parity-check codes using irregular graphs and belief propagation , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).
[10] Joachim Hagenauer,et al. Rate-compatible punctured convolutional codes (RCPC codes) and their applications , 1988, IEEE Trans. Commun..
[11] T. Etzion,et al. Which codes have cycle-free Tanner graphs? , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).
[12] Sarah J. Johnson,et al. A family of irregular LDPC codes with low encoding complexity , 2003, IEEE Communications Letters.
[13] Tiffany Jing Li,et al. Rate-compatible Low Density Parity Check Codes for Capacity-approaching ARQ Schemes in Packet Data Communications , 2002, Communications, Internet, and Information Technology.
[14] Shu Lin,et al. Error Control Coding , 2004 .
[15] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[16] David J. C. MacKay,et al. Good Codes Based on Very Sparse Matrices , 1995, IMACC.
[17] Li Ping,et al. Low density parity check codes with semi-random parity check matrix , 1999 .
[18] Amir H. Banihashemi,et al. On construction of rate-compatible low-density Parity-check codes , 2004, IEEE Commun. Lett..
[19] M. Sarfraz,et al. KING FAHD UNIVERSITY OF PETROLEUM AND MINERALS , 2003 .
[20] J. Bibb Cain,et al. Error-Correction Coding for Digital Communications , 1981 .
[21] Lance C. Perez,et al. Rate-compatible low-density parity-check codes with rate-compatible degree profiles , 2006 .
[22] Muhammad H. Alsuwaiyel,et al. Algorithms - Design Techniques and Analysis , 1999, Lecture Notes Series on Computing.
[23] Amir H. Banihashemi,et al. A heuristic search for good low-density parity-check codes at short block lengths , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).
[24] Steven W. McLaughlin,et al. Rate-compatible punctured low-density parity-check codes with short block lengths , 2006, IEEE Transactions on Information Theory.
[25] John G. Proakis,et al. Digital Communications , 1983 .