Improved low-complexity low-density parity-check decoding
暂无分享,去创建一个
[1] Shu Lin,et al. A class of low-density parity-check codes constructed based on Reed-Solomon codes with two information symbols , 2003, IEEE Communications Letters.
[2] Shu Lin,et al. Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.
[3] Marc P. C. Fossorier,et al. A modified weighted bit-flipping decoding of low-density Parity-check codes , 2004, IEEE Communications Letters.
[4] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[5] David J. C. MacKay,et al. Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.
[6] Jeremy Thorpe,et al. Memory-efficient decoding of LDPC codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[7] Lajos Hanzo,et al. Reliability ratio based weighted bit-flipping decoding for low-density parity-check codes , 2004 .
[8] Ming Jiang,et al. An improvement on the modified weighted bit flipping decoding algorithm for LDPC codes , 2005, IEEE Commun. Lett..
[9] Yu Kou,et al. Low Density Parity Check Codes Based on Finite Geometries: A Rediscovery and More , 1999 .
[10] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[11] A. J. Blanksby,et al. A 690-mW 1-Gb/s 1024-b, rate-1/2 low-density parity-check code decoder , 2001, IEEE J. Solid State Circuits.
[12] Ajay Dholakia,et al. Reduced-complexity decoding of LDPC codes , 2005, IEEE Transactions on Communications.