This paper proposes a new iterative algorithm for low-density parity check (LDPC) codes. The flipping function is altered much more effectively to increase the performance of the decoding process. Weights are derived based on the reliability of the bits. The algorithm is validated through simulation results that compare various decoding algorithms. A significant gain (>0.3 dB) is observed over the standard weighted bit flipping (WBF) algorithm while the increase in complexity of computation is not so noticeable. LDPC codes are increasingly used in applications that require efficient and highly reliable transfer of information over limited bandwidth or return channel-constrained links of noise-affected channels.