Abstract: Two simple and efficient weighted bit flipping (WBF) decoding algorithms for low density parity-check (LDPC) codes are proposed, in which the sum of the variable nodes’magnitude is introduced to compute the reliability of the parity checks. Simulation results shows that the performance of one of the improved scheme is better than that of traditional WBF and modified WBF (MWBF) algorithms about 1.65 dB and 1.31 dB at BER of 10-5over an additive white Gaussian noise channel, respectively, while the average number of decoding iterations is significantly reduced.