Exhaustive Enumeration of Elementary Trapping Sets of an Arbitrary Tanner Graph
暂无分享,去创建一个
[1] Chih-Chun Wang,et al. Finding the Exhaustive List of Small Fully Absorbing Sets and Designing the Corresponding Low Error-Floor Decoder , 2012, IEEE Transactions on Communications.
[2] Amir H. Banihashemi,et al. New Characterization and Efficient Exhaustive Search Algorithm for Elementary Trapping Sets of Variable-Regular LDPC Codes , 2015, ArXiv.
[3] David J. C. MacKay,et al. Encyclopedia of Sparse Graph Codes , 1999 .
[4] Amir H. Banihashemi,et al. On Characterization of Elementary Trapping Sets of Variable-Regular LDPC Codes , 2014, IEEE Trans. Inf. Theory.
[5] H. Vincent Poor,et al. Finding All Small Error-Prone Substructures in LDPC Codes , 2009, IEEE Transactions on Information Theory.
[6] Amir H. Banihashemi,et al. An efficient algorithm for finding dominant trapping sets of LDPC codes , 2011, 2010 6th International Symposium on Turbo Codes & Iterative Information Processing.
[7] Amir H. Banihashemi,et al. On Characterization and Efficient Exhaustive Search of Elementary Trapping Sets of Variable-Regular LDPC Codes , 2015, IEEE Communications Letters.
[8] Paul H. Siegel,et al. Efficient Algorithms to Find All Small Error-Prone Substructures in LDPC Codes , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.
[9] David Declercq,et al. Trapping set enumerators for specific LDPC codes , 2010, 2010 Information Theory and Applications Workshop (ITA).