%0 Journal Article %T Geometry Construction of (n,3,k) LDPC Codes without Short Cycles
不含短环的(n,3,k)LDPC码的几何构造方法 %A Ma Zhe %A Du Xing-min %A Ma Lin-hua %A
马 哲 %A 杜兴民 %A 马林华 %J 电子与信息学报 %D 2006 %I %X In this paper, based on (n,2,k) regular Low Density Parity-Check (LDPC) codes without short cycles, a geometry method for the construction of(n,3,k) regular LDPC codes with 8-girth is proposed,which is simple,intuitionistic and effective. Simulation results show that these codes achieve obviously better performance than randomly constructed regular LDPC codes over AWGN channals. %K LDPC codes %K Admissible slope pair %K Cycle %K Sum-product decoding
LDPC码 %K 容许斜度对 %K 环 %K 和-积译码 %U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=35ED0E4872EF5B6A&yid=37904DC365DD7266&vid=D3E34374A0D77D7F&iid=59906B3B2830C2C5&sid=78F86A6056590509&eid=A113722260CE9028&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=6