[1] [1] Bennett C H,Brassard G.Quantum Cryptography:Public Key Distribution and Coin Tossing ☆［J］.Theoretical Computer Science,1984,175:175-179.DOI:101016／j.tcs.201405025.

[2] [2] Van Assche G,Cardinal J,Cerf N J.Reconciliation of a Quantum-distributed Gaussian Key［J］.Information Theory IEEE Transactions on,2002,50(2):394-400.DOI:101109／tit.2003822618.

[3] [3] Bai Z L,Yang S S,Li Y M.High-efficiency Reconciliation for Continuous Variable Quantum Key Distribution［J］.Japanese Journal of Applied Physics,2017,56(4):DOI:107567／jjap.56044401.

[4] [4] Gallager R G.Low-density Parity-check Codes［C］.1963:550.DOI:101007／0-306-47794-7_8.

[5] [5] Mackay D J C,Neal R M.Near Shannon Limit Performance of Low Density Parity Check Codes［J］.Electronics Letters,2013,32(6):457-458.DOI:101049／el:19970362.

[6] [6] Peng H,Yang J,Sun L.Construction Method of QC-LDPC Codes with Big Girth for Fast Encoding［J］.Computer Engineering,2018,44(1):128-133.DOI:103969／j.issn.1000-3428201801021.

[7] [7] Leverrier A,All,Eacute R,et al.Multidimensional Reconciliation for a Continuous-variable Quantum Key Distribution［C］∥IEEE International Symposium on Information Theory.2008:1020-1024.DOI:101109／ISIT.20084595141.

[9] [9] Asp H,Bengtsson B,Jensén P.Long Distance Continuous-Variable Quantum Key Distribution with a Gaussian Modulation［J］.Physical Review A,2011,84(6):-.DOI:101103／PhysRevA.84062317.

[10] [10] Miguel N,Antonio A.Security Bounds for Continuous Variables Quantum Key Distribution［J］.Physical Review Letters,2004,94(2):020505.DOI:101103／PhysRevLett.94020505.

[11] [11] Margulis G A.Explicit Constructions of Graphs Without Short Cycles and Low Density Codes［J］.Combinatorica,1982,2(1):71-78.DOI:101007／bf02579283.

[12] [12] Xiao H,Banihashemi A H.Improved Progressive-edge-growth (PEG) Construction of Irregular LDPC Codes［J］.IEEE Communications Letters,2004,8(12):715-717.DOI:101109／LCOMM.2004839612.

[13] [13] Sipser M,Spielman D A.Expander Codes［J］.Information Theory IEEE Transactions on,1996,42(6):1710-1722.DOI:101109／18556667.

[14] [14] Hu X Y,Eleftheriou E,Arnold D M.Progressive Edge-growth Tanner Graphs［C］∥Global Telecommunications Conference,2001.GLOBECOM '01.IEEE.2002:995-1001 vol.2.DOI:101109／GLOCOM.2001965567.

[15] [15] Hu X Y,Eleftheriou E,Arnold D M,et al.Regular and Irregular Progressive Edge-growth Tanner Graphs［J］.IEEE Transactions on Information Theory,2005,51(1):386-398.DOI:101109／tit.2004839541.

[16] [16] Bai Z L,Wang X Y,Yang S S,et al.High-efficiency Gaussian Key Reconciliation in Continuous Variable Quantum Key Distribution［J］.Science China Physics Mechanics ＆ Astronomy,2016,59(1):614201-614201.DOI:101007／s11433-015-5702-7.

[17] [17] Luby M,Mitzenmacher M,Shokrollah A,et al.Analysis of Low Density Codes and Improved Designs using Irregular Graphs［C］.1998:DOI:101145／276698276756.

[18] [18] Luby M G,Amin Shokrolloahi M,Mizenmacher M,et al.Improved Low-density Parity-check Codes using Irregular Graphs and Belief Propagation［C］∥IEEE International Symposium on Information Theory.1998:DOI:101109／ISIT.1998708706.