| Abstract: |
Recently, the application of LDPC codes over the binary erasure channel
(BEC) has been studied extensively. A possible application is the
transmission of data over communication networks. We propose an improved
decoding method for LDPC codes over the binary erasure channel. The
proposed algorithm has error rates several orders of magnitude less
than that of the standard iterative decoding while having almost the
same complexity. The performance of LDPC codes over the BEC is
determined by stopping sets in the corresponding bipartite graph. We
also present some results on the problem of finding stopping sets. For
example, we show that the problem of determining whether a bipartite
graph has a stopping set of a given size is NP-hard.
|