%0 Journal Article
%T On the Stopping Sets of Finite Plane LDPC Codes<br>有限平面LDPC码的停止集
%A Xia Shu-tao
%A Hu Mao-zhi
%A <br>夏树涛
%A 胡懋智
%J 电子与信息学报
%D 2007
%I 
%X Finite plane LDPC codes are important structured LDPC codes, which have excellent performance under iterative decoding algorithm. It is a key problem that to evaluate the performance of LDPC codes under iterative decoding. Recently, the stopping sets and stopping distance of Tanner graph are of interests in performance evaluation. In this paper, the smallest sets of finite plane LDPC codes are studied. It shows that for finite plane LDPC codes, a smallest stopping set is the support of a codeword. These results give positive consequences for the good performance of finite plane LDPC codes under iterative decoding.
%K Low-Density Parity-Check (LDPC) codes
%K Finite geometry
%K Iterative decoding
%K Stopping set
%K Stopping distance<br>低密度校验(LDPC)码
%K 有限几何
%K 迭代译码
%K 停止集
%K 停止距离
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=1319827C0C74AAE8D654BEA21B7F54D3&jid=EFC0377B03BD8D0EF4BBB548AC5F739A&aid=80D0C5E216BAC308&yid=A732AF04DDA03BB3&vid=771469D9D58C34FF&iid=B31275AF3241DB2D&sid=995E04834DE9F169&eid=5A64531D29896B77&journal_id=1009-5896&journal_name=电子与信息学报&referenced_num=0&reference_num=12