On the Smallest Absorbing Sets of LDPC Codes From Finite Planes
暂无分享,去创建一个
Haiyang Liu | Jie Chen | Lianrong Ma | Yan Li | Haiyang Liu | Lianrong Ma | Yan Li | Jie Chen
[1] David J. C. MacKay,et al. Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check cCodes , 2003, MFCSIT.
[2] Tom Høholdt,et al. Iterative List Decoding of Some LDPC Codes , 2007, IEEE Transactions on Information Theory.
[3] Shuai Zhang,et al. On the dynamics of the error floor behavior in regular LDPC codes , 2009, 2009 IEEE Information Theory Workshop.
[4] O. Milenkovic,et al. Algorithmic and combinatorial analysis of trapping sets in structured LDPC codes , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.
[5] P. Vontobel,et al. Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes , 2005, ArXiv.
[6] Lara Dolecek,et al. Towards improved LDPC code designs using absorbing set spectrum properties , 2010, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.
[7] Lara Dolecek,et al. On absorbing sets of structured sparse graph codes , 2010, 2010 Information Theory and Applications Workshop (ITA).
[8] Thomas J. Richardson,et al. Error Floors of LDPC Codes , 2003 .
[9] A. Vardy,et al. Stopping sets in codes from designs , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..
[10] Roxana Smarandache,et al. Pseudo-Codeword Analysis of Tanner Graphs From Projective and Euclidean Planes , 2006, IEEE Transactions on Information Theory.
[11] Lara Dolecek,et al. GEN03-6: Investigation of Error Floors of Structured Low-Density Parity-Check Codes by Hardware Emulation , 2006, IEEE Globecom 2006.
[12] Shu Lin,et al. Iterative decoding of one-step majority logic deductible codes based on belief propagation , 2000, IEEE Trans. Commun..
[13] Yu Kou,et al. Low Density Parity Check Codes Based on Finite Geometries: A Rediscovery and More , 1999 .
[14] Suquan Ding. Iterative Decoding of L-step Majority-Logic Decodable Codes Based on Belief Propagation , 2007, International Conference on Wireless Communications, Networking and Mobile Computing.
[15] Johannes B. Huber,et al. The Trapping Redundancy of Linear Block Codes , 2006, IEEE Transactions on Information Theory.
[16] Lara Dolecek,et al. Design of LDPC decoders for improved low error rate performance: quantization and algorithm choices , 2009, IEEE Transactions on Communications.
[17] Shu Lin,et al. Codes on finite geometries , 2005, IEEE Transactions on Information Theory.
[18] Shu Lin,et al. Low-density parity-check codes based on finite geometries: A rediscovery and new results , 2001, IEEE Trans. Inf. Theory.
[19] Lara Dolecek,et al. Analysis of Absorbing Sets and Fully Absorbing Sets of Array-Based LDPC Codes , 2009, IEEE Transactions on Information Theory.
[20] J. Hirschfeld. Projective Geometries Over Finite Fields , 1980 .
[21] Lara Dolecek,et al. Absorbing set spectrum approach for practical code design , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.
[22] Lara Dolecek,et al. Controlling LDPC Absorbing Sets via the Null Space of the Cycle Consistency Matrix , 2011, 2011 IEEE International Conference on Communications (ICC).
[23] Lara Dolecek,et al. Lowering LDPC Error Floors by Postprocessing , 2008, IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference.
[24] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[25] Emre Telatar,et al. Finite-length analysis of low-density parity-check codes on the binary erasure channel , 2002, IEEE Trans. Inf. Theory.