Weighted nonbinary repeat-accumulate codes
暂无分享,去创建一个
[1] Dariush Divsalar,et al. Coding theorems for 'turbo-like' codes , 1998 .
[2] D. Mackay,et al. Low-Density Parity Check Codes over , 1998 .
[3] Nazanin Rahnavard,et al. Nonuniform error correction using low-density parity-check codes , 2005, IEEE Transactions on Information Theory.
[4] Joachim Hagenauer,et al. Iterative decoding of binary block and convolutional codes , 1996, IEEE Trans. Inf. Theory.
[5] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[6] Rüdiger L. Urbanke,et al. Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.
[7] Radford M. Neal,et al. Near Shannon limit performance of low density parity check codes , 1996 .
[8] H. Jin,et al. Irregular repeat accumulate codes , 2000 .
[9] 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.
[10] Sae-Young Chung,et al. Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.
[11] David J. C. MacKay,et al. Low-density parity check codes over GF(q) , 1998, IEEE Communications Letters.
[12] Matthew C. Davey,et al. Error-Correction using Low Density Parity Check Codes , 1999 .
[13] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[14] Brendan J. Frey,et al. Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.