Protograph based low error floor LDPC coded modulation
暂无分享,去创建一个
[1] Andrea Montanari,et al. Weight distributions of LDPC code ensembles: combinatorics meets statistical physics , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..
[2] Simon Litsyn,et al. Distance distributions in ensembles of irregular low-density parity-check codes , 2003, IEEE Trans. Inf. Theory.
[3] J. Thorpe. Low-Density Parity-Check (LDPC) Codes Constructed from Protographs , 2003 .
[4] Robert Michael Tanner,et al. A recursive approach to low complexity codes , 1981, IEEE Trans. Inf. Theory.
[5] Dariush Divsalar,et al. Accumulate repeat accumulate codes , 2004, ISIT.
[6] Rüdiger L. Urbanke,et al. Design of capacity-approaching irregular low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.
[7] Hui Jin,et al. Irregular Repeat – Accumulate Codes 1 , 2000 .
[8] Alain Glavieux,et al. Reflections on the Prize Paper : "Near optimum error-correcting coding and decoding: turbo codes" , 1998 .
[9] Radford M. Neal,et al. Near Shannon limit performance of low density parity check codes , 1996 .
[10] T. Richardson,et al. Multi-Edge Type LDPC Codes , 2004 .
[11] Shu Lin,et al. A combinatoric superposition method for constructing low density parity check codes , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..
[12] Robert F. H. Fischer,et al. Multilevel codes: Theoretical concepts and practical design rules , 1999, IEEE Trans. Inf. Theory.
[13] David Burshtein,et al. Asymptotic enumeration methods for analyzing LDPC codes , 2004, IEEE Transactions on Information Theory.
[14] Rüdiger L. Urbanke,et al. The renaissance of Gallager's low-density parity-check codes , 2003, IEEE Commun. Mag..
[15] Emre Telatar,et al. Finite-length analysis of low-density parity-check codes on the binary erasure channel , 2002, IEEE Trans. Inf. Theory.
[16] Sae-Young Chung,et al. On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit , 2001, IEEE Communications Letters.
[17] Shu Lin,et al. Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.
[18] Frank R. Kschischang. Codes defined on graphs , 2003, IEEE Commun. Mag..
[19] Jeremy Thorpe,et al. Enumerators for protograph ensembles of LDPC codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..
[20] Dariush Divsalar,et al. Constructing LDPC codes from simple loop-free encoding modules , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.
[21] Simon Litsyn,et al. On ensembles of low-density parity-check codes: Asymptotic distance distributions , 2002, IEEE Trans. Inf. Theory.
[22] 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).
[23] Rudiger Urbanke,et al. Weight distributions: how deviant can you be? , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).
[24] Daniel A. Spielman,et al. Analysis of low density codes and improved designs using irregular graphs , 1998, STOC '98.
[25] Dariush Divsalar,et al. Coding theorems for 'turbo-like' codes , 1998 .
[26] Rüdiger L. Urbanke,et al. The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.
[27] Hui Jin,et al. Block Error Iterative Decoding Capacity for LDPC Codes , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..