| ［1］ |
GALLAGER R G. Low-density Parity-check Codes［J］. IRE Transactions on Information Theory, 1962, 8(1): 21-28.<br />
|
| ［2］ |
MCGREGOR A, MILENKOVIC O. On the Hardness of Approximating Stopping and Trapping Sets［J］. IEEE Transactions on Information Theory, 2010, 56(4): 1640-1650.<br />
|
| ［3］ |
BLAKE I, LIN S. On Short Cycle Enumeration in Biregular Bipartite Graphs［J］. IEEE Transactions on Information Theory, 2017, 64(10): 6526-6535.<br />
|
| ［4］ |
GUO J J, MU J, JIAO X, et al. Finding Small Fundamental Instantons of LDPC Codes by Path Extension［J］. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2014, E97-A(4): 1001-1004.<br />
|
| ［5］ |
HASHEMI Y, BANIHASHEMI A H. Characterization and Efficient Exhaustive Search Algorithm for Elementary Trapping Sets of Irregular LDPC Codes［C］／／Proceedings of the 2017 IEEE International Symposium on Information Theory. Piscataway: IEEE, 2017: 1192-1196.<br />
|
| ［6］ |
KAKAKHAIL S, REYNAL S, DECLERCQ D, et al. An Efficient Pseudo-codeword Search Algorithm for Belief Propagation Decoding of LDPC Codes［C］／／Proceedings of the 2009 International Conference on Ultra Modern Telecommunications and Workshops. Washington: IEEE Computer Society, 2009: 1-5.<br />
|
| ［7］ |
CHILAPPAGARI S K, CHERTKOV M, VASIC B. An Efficient Instanton Search Algorithm for LP Decoding of LDPC Codes over the BSC［J］. IEEE Transactions on Information Theory, 2011, 57(7): 4417-4426.<br />
|
| ［8］ |
LIU X, DRAPER S C. Instanton Search Algorithm for the ADMM Penalized Decoder［C］／／Proceedings of the 2014 IEEE International Symposium on Information Theory. Piscataway: IEEE, 2014: 696-700.<br />
|
| ［9］ |
WEI H, BANIHASHEMI A H. An Iterative Check Polytope Projection Algorithm for ADMM-based LP Decoding of LDPC Codes［J］. IEEE Communications Letters, 2018, 22(1): 29-32.<br />
|
| ［10］ |
WANG B, MU J, JIAO X, et al Improved Penalty Functions of ADMM Penalized Decoder for LDPC Codes［J］. IEEE Communications Letters, 2017, 21(2): 234-237.<br />
|
| ［11］ |
TANNER R M, SRIDHARA D, FUJA T. A Class of Group-structured LDPC Codes［C］／／Proceedings of the 2001 6th International Symposium on Communication Theory and Applications. Piscataway: IEEE, 2001: 365-370.<br />
|
| ［12］ |
焦晓鹏, 慕建君, 周利华. 一种Tanner图短环计数新方法［J］. 西安电子科技大学学报, 2010, 37(2): 311-314.<br />
|
|
JIAO Xiaopeng, MU Jianjun, ZHOU Lihua. Novel Method for Counting Short Cycles of Tanner Graphs［J］. Journal of Xidian University, 2010, 37(2): 311-314.<br />
|
|
<div>
|
|
<br />
|
|
</div>
|
