An optimized split row algorithm is to be developed to reduce effectively the Bit Error Rate effectively. The usage of LDPC codes, especially in the error correction schemes, is tremendously increasing in the modern era. In the conventional approach, the entire matrix which is computed always leads to computational complexity. As for this, the matrix is split into two equal halves and then error checking is done. In such case, it is difficult to judge which partition has to be taken first. Also, it is necessary to reduce the Bit Error Rate. In this Study a novel technique based on fixing appropriate distance between bits and checking it with a predefined condition. It is also observed that as the number of iterations increases, BER decreases.