Weight Distribution of Low-Density Parity-Check Codes
暂无分享,去创建一个
[1] 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).
[2] David Burshtein,et al. Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes , 2000, IEEE Trans. Inf. Theory.
[3] M. Shokrollahi,et al. Capacity-achieving sequences , 2001 .
[4] Thomas J. Richardson,et al. An Introduction to the Analysis of Iterative Coding Systems , 2001 .
[5] Edward A. Bender,et al. Central and Local Limit Theorems Applied to Asymptotic Enumeration II: Multivariate Generating Functions , 1983, J. Comb. Theory, Ser. A.
[6] Aliazam Abbasfar. Turbo-like codes , 2007 .
[7] Fabrizio Pollara,et al. Improving turbo-like codes using iterative decoder analysis , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).
[8] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[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] Aamod Dinkar Khandekar. Graph-based codes and iterative decoding , 2003 .
[11] D. A. Bell,et al. Information Theory and Reliable Communication , 1969 .
[12] Rüdiger L. Urbanke,et al. Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.
[13] M. Aminshokrollahi. New sequences of linear time erasure codes approaching the channel capacity , 1999 .
[14] Simon Litsyn,et al. Distance distributions in ensembles of irregular low-density parity-check codes , 2003, IEEE Trans. Inf. Theory.
[15] Gregory Poltyrev,et al. Bounds on the decoding error probability of binary linear codes via their spectra , 1994, IEEE Trans. Inf. Theory.
[16] Daniel A. Spielman,et al. Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.
[17] Louay Bazzi,et al. Minimum distance of error correcting codes versus encoding complexity, symmetry, and pseudorandomness , 2003 .
[18] Béla Bollobás,et al. Random Graphs: Notation , 2001 .
[19] H. Jin,et al. Irregular repeat accumulate codes , 2000 .
[20] Rüdiger L. Urbanke,et al. Efficient encoding of low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.
[21] Simon Litsyn,et al. On ensembles of low-density parity-check codes: Asymptotic distance distributions , 2002, IEEE Trans. Inf. Theory.
[22] Béla Bollobás,et al. Random Graphs , 1985 .
[23] Alon Orlitsky,et al. Stopping set distribution of LDPC code ensembles , 2003, IEEE Transactions on Information Theory.
[24] R. Urbanke,et al. Weight Distribution of Iterative Coding Systems: How Deviant can You be? , 2001 .
[25] Emre Telatar,et al. On the Asymptotic Input-Output Weight Distributions and Thresholds of Convolutional and Turbo-Like Codes , 2006 .
[26] T. Richardson,et al. Design of provably good low-density parity check codes , 2000, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060).
[27] Andrea Montanari,et al. Weight distributions of LDPC code ensembles: combinatorics meets statistical physics , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[28] David Burshtein,et al. Asymptotic enumeration methods for analyzing LDPC codes , 2004, IEEE Transactions on Information Theory.