| On the Stopping Distance and Stopping Redundancy of Finite Geometry LDPC Codes (2008) | |||||||||||||
Abstract | |||||||||||||
| The stopping distance and stopping redundancy of a linear code are important concepts in the analysis of the performance and complexity of the code under iterative decoding on a binary erasure channel. In this paper, we studied the stopping distance and stopping redundancy of Finite Geometry LDPC (FG-LDPC) codes, and derived an upper bound of the stopping redundancy of FG-LDPC codes. It is shown from the bound that the stopping redundancy of the codes is less than the code length. Therefore, FG-LDPC codes give a good trade-off between the performance and complexity and hence are a very good choice for practical applications. | |||||||||||||
Publication details | |||||||||||||
| |||||||||||||