On the stopping distance of LDPC codes based on symplectic space over finite fields

Abstract

By using the important concept of stoping distance of the LDPC codes, how to perform about the iterative decoding of the LDPC codes in binary erasure channels is analyzed. In this article, we introduce a class of LDPC codes designed on the premise of the symplectic space over finite fields. An important parameter of stopping distance is estimated mainly and the lower bound on the stopping distance of the code designed on the premise of symplectic space is acquired.