On the Stopping Sets of Finite Plane LDPC Codes
有限平面LDPC码的停止集

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.