The renaissance of Gallager's low-density parity-check codes
暂无分享,去创建一个
[1] Dariush Divsalar,et al. Coding theorems for 'turbo-like' codes , 1998 .
[2] Niclas Wiberg,et al. Codes and Decoding on General Graphs , 1996 .
[3] D. Spielman,et al. Expander codes , 1996 .
[4] Shu Lin,et al. A general class of LDPC finite geometry codes and their performance , 2002, Proceedings IEEE International Symposium on Information Theory,.
[5] 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.
[6] Daniel A. Spielman,et al. Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.
[7] A. Glavieux,et al. Near Shannon limit error-correcting coding and decoding: Turbo-codes. 1 , 1993, Proceedings of ICC '93 - IEEE International Conference on Communications.
[8] Robert J. McEliece,et al. On the complexity of reliable communication on the erasure channel , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).
[9] Brendan J. Frey,et al. Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.
[10] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[11] Rüdiger L. Urbanke,et al. Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.
[12] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[13] David J. C. MacKay,et al. Good Codes Based on Very Sparse Matrices , 1995, IMACC.
[14] Rüdiger L. Urbanke,et al. Efficient encoding of low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.