Asymptotic weight enumerators of randomly punctured, expurgated, and shortened code ensembles
暂无分享,去创建一个
[1] Robert J. McEliece,et al. BSC Thresholds for Code Ensembles Based on “Typical Pairs” Decoding , 2001 .
[2] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[3] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.
[4] D. Divsalar. A Simple Tight Bound on Error Probability of Block Codes with Application to Turbo Codes , 1999 .
[5] David J. C. MacKay,et al. Good Error-Correcting Codes Based on Very Sparse Matrices , 1997, IEEE Trans. Inf. Theory.
[6] Jae Hong Lee,et al. Undetected error probabilities of binary primitive BCH codes for both error correction and detection , 1996, IEEE Trans. Commun..
[7] Sarah Lynne Sweatlock,et al. Asymptotic Weight Analysis of Low-Density Parity Check (LDPC) Code Ensembles , 2008 .
[8] Simon Litsyn,et al. On ensembles of low-density parity-check codes: Asymptotic distance distributions , 2002, IEEE Trans. Inf. Theory.
[9] Richard M. Wilson,et al. A course in combinatorics , 1992 .
[10] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[11] Noga Alon,et al. The Probabilistic Method, Second Edition , 2004 .