|
|
|
| On the Stopping Sets of Finite Plane LDPC Codes |
| Xia Shu-tao; Hu Mao-zhi |
| Graduate School at Shenzhen of Tsinghua University, Shenzhen 518055, China |
|
|
|
|
Abstract 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.
|
|
Received: 24 October 2005
|
|
|
|
|
|
|
|
|
2007, Vol. 29 
