As shown in title, I am studying the LDPC code recently. However, I still can not calculate the error correction capacity of it, maybe due to complex decoding algorithm. And there lacks easy understanding properties to infer the error correction.


An easy example is RS code (Reed solomon code). For the setting RS(N,k), while N is the block size and K is the useful symbol size. And the error correction capacity is (N-K)/2. 


Is there any easy properties like RS code for LDPC code?
Thanks!



How to quantify the error correction capacity of LDPC code?
It is a difficult problem to find the minimum distance of an LDPC. Vardy shows in [The Intractability of Computing the Minimum Distance of a Code](https://ieeexplore.ieee.org/document/641542) that it is NP-hard to find the minimum distance. Looking around one can find papers with various algorithms for minimum distance, but there won't be anything nice like for RS codes. For example, there is a randomized algorithm in [On the Computation of the Minimum Distance of Low-Density Parity-Check Codes](http://wol.ra.phy.cam.ac.uk/mackay/codes/MINDIST/main.pdf) by Hu and Fossorier.


