%0 Journal Article
%T Construction of Quasi-Cyclic LDPC Codes From Prime Fields<br>基于素域构造的准循环低密度校验码
%A Lin Guo-qing Chen Ru-wei Wang Xin-mei Xiao Guo-zhen
%A <br>林国庆
%A 陈汝伟
%A 王新梅
%A 肖国镇
%J 电子与信息学报
%D 2010
%I 
%X This paper presents a method to construct quasi-cyclic LDPC codes from prime fields. This method is a generalization of a method proposed by Lan et al to construct quasi-cyclic LDPC codes based on finite fields, and gives a much larger class of quasi-cyclic LDPC codes based on prime fields. Simulations show that quasi-cyclic LDPC codes constructed by the proposed method perform well over AWGN channels with iterative decoding.
%K Low-Density Parity-Check (LDPC) code
%K Quasi-cyclic code
%K Prime field
%K Primitive element<br>低密度校验码
%K 准循环码
%K 素域
%K 本原元
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=C5CDD8A50FEE36D60BA6392BE452BFC0&yid=140ECF96957D60B2&vid=9971A5E270697F23&iid=38B194292C032A66&sid=5568599C60D4BE87&eid=EF9E84B2DA79FF23&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=6