[1]BERLEKAMP E R,McELIECE R J,van TILBORG H C A. On the inherent intractability of certain coding problems[J]. IEEE Transactions on Information Theory,1978,24(3):384-386.[2]McELIECE R J. A public-key cryptosystem based on algebraic coding theory[EB/OL].[2010-10-20].http://www.cs.colorado.edu/~jrblack/class/csci7000/f03/.../mceliece.pdf.[3]NIEDERREITER H. Knapsack-type crypto-systems and algebraic coding theory[J]. Problems of Control and Information Theory,1986,15(2):159-166.[4]GALLAGER R G. Low-density parity-check codes[J]. IRE Transactions on Information Theory,1962,8(1):21-28.[5]MONICO C, ROSENTHAL J, SHOKROLLAHI A. Using low density parity check codes in the McEliece cryptosystem[C]// IEEE International Symposium on Information Theory. New York: IEEE, 2000:215.[6]RICHARDSON T J, URBANKE R L. The capacity of low-density parity-check codes under message-passing decoding[EB/OL].[2010-09-25].http://www.ldpc-codes.com/papers/capacity.pdf.[7]BALDI M,CHIARALUCE F. Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC codes[C]// IEEE International Symposium on Information Theory. New York: IEEE, 2007:2591-2595.[8]LI YUANXING, DEN R H, WANG XINMEI. On the equivalence of McElieces and Niederreiters public-key cryptosystems[J]. IEEE Transactions on Information Theory, 1994,40(1):271-273.[9]TANNER R M.A recursive approach to low complexity codes[J]. IEEE Transactions on Information Theory, 1981,27(5):533-547.[10]STERN J. A method for finding codewords of small weight[C]// Proceedings of the 3rd International Colloquium on Coding Theory and Applications. London: Springer-Verlag, 1989:106-113.[11]HIROTOMO M, MOHRI M, MORII M. A probabilistic computation method for the weight distributionof low-density parity-check codes[C]// IEEE International Symposium on Information Theory. New York:IEEE, 2005: 2166-2170.