Abstract—Shortening is a technique that can be used for constructing rate-compatible low-complexity LDPC codes. However, minimum SNR required to achieve error free decoding in the case of long block length, known as decoding threshold, for shortened LDPC code has not been reported. This motivates us to slightly modify the Monte Carlo simulation originally invented M. Davey to compute decoding threshold of the shortened LDPC codes. From the simulation results, we found that decoding threshold of shortened LDPC codes based on uniform shortening algorithm is identical to conventional LDPC codes designed for specific coding rate. Moreover, the number of iteration used to achieve successful decoding of shortened code and conventional code are slightly different.