Generalized LDPC codes with Reed-Solomon and BCH codes as component codes for binary channels
暂无分享,去创建一个
[1] Daniel A. Spielman,et al. Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.
[2] 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).
[3] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[4] M. Luby,et al. Verification Codes , 2002 .
[5] L. Bazzi,et al. Exact thresholds and optimal codes for the binary symmetric channel and Gallager's decoding algorithm A , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).
[6] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[7] Bahram Honary,et al. Decoding of generalised low-density parity-check codes using weighted bit-flip voting , 2002 .
[8] Emre Telatar,et al. Finite-length analysis of low-density parity-check codes on the binary erasure channel , 2002, IEEE Trans. Inf. Theory.
[9] J. Boutros,et al. Generalized low density (Tanner) codes , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).
[10] Eugen Lupu,et al. On the speaker verification using the TESPAR coding method , 2003, Signals, Circuits and Systems, 2003. SCS 2003. International Symposium on.
[11] Michael Lentmaier,et al. On generalized low-density parity-check codes based on Hamming component codes , 1999, IEEE Communications Letters.
[12] Radford M. Neal,et al. Near Shannon limit performance of low density parity check codes , 1996 .