Design of provably good low-density parity check codes
暂无分享,去创建一个
[1] T. Broadbent. Measure and Integral , 1957, Nature.
[2] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[3] J. Hopcroft,et al. Proceedings of the fifth annual ACM symposium on Theory of computing , 1977 .
[4] 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.
[5] Rainer Storn,et al. Differential Evolution Design of an IIR-Filter with Requirements for Magnitude and Group Delay , 1995 .
[6] R. Storn,et al. On the usage of differential evolution for function optimization , 1996, Proceedings of North American Fuzzy Information Processing.
[7] Daniel A. Spielman,et al. Practical loss-resilient codes , 1997, STOC '97.
[8] Rainer Storn,et al. Differential Evolution – A Simple and Efficient Heuristic for global Optimization over Continuous Spaces , 1997, J. Glob. Optim..
[9] Daniel A. Spielman,et al. Analysis of low density codes and improved designs using irregular graphs , 1998, STOC '98.
[10] Michael Mitzenmacher,et al. Analysis of random processes via And-Or tree evaluation , 1998, SODA '98.
[11] Amin Shokrollahi,et al. New Sequences of Linear Time Erasure Codes Approaching the Channel Capacity , 1999, AAECC.
[12] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.