On the Stopping Distance and Stopping Redundancy of Finite Geometry LDPC Codes

Hai-yang LIU  Xiao-yan LIN  Lian-rong MA  Jie CHEN  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E91-A    No.8    pp.2159-2166
Publication Date: 2008/08/01
Online ISSN: 1745-1337
DOI: 10.1093/ietfec/e91-a.8.2159
Print ISSN: 0916-8508
Type of Manuscript: PAPER
Category: Coding Theory
Finite Geometry,  LDPC codes,  stopping distance,  stopping redundancy,  

Full Text: PDF>>
Buy this Article

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.