Construction of near-optimum burst erasure correcting low-density parity-check codes
IEEE Transactions on Communications
Fingerprinting with minimum distance decoding
IEEE Transactions on Information Forensics and Security
Guessing facets: polytope structure and improved LP decoder
IEEE Transactions on Information Theory
An efficient algorithm to find all small-size stopping sets of low-density parity-check matrices
IEEE Transactions on Information Theory
A belief propagation based recommender system for online services
Proceedings of the fourth ACM conference on Recommender systems
Capacity-achieving codes with bounded graphical complexity and maximum likelihood decoding
IEEE Transactions on Information Theory
Systematic design of low-density parity-check code ensembles for binary erasure channels
IEEE Transactions on Communications
Hardness of approximation results for the problem of finding the stopping distance in tanner graphs
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Addressing the concerns of the lacks family: quantification of kin genomic privacy
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 755.02 |
This paper investigates decoding of low-density parity-check (LDPC) codes over the binary erasure channel (BEC). We study the iterative and maximum-likelihood (ML) decoding of LDPC codes on this channel. We derive bounds on the ML decoding of LDPC codes on the BEC. We then present an improved decoding algorithm. The proposed algorithm has almost the same complexity as the standard iterative decoding. However, it has better performance. Simulations show that we can decrease the error rate by several orders of magnitude using the proposed algorithm. We also provide some graph-theoretic properties of different decoding algorithms of LDPC codes over the BEC which we think are useful to better understand the LDPC decoding methods, in particular, for finite-length codes.