The encoding and decoding of binary LDPC codes are expanded using characteristics of the Finite Fields concept, a nonbinary LDPC code encoding and decoding method based on the Finite Fields are investigated and the computational complexity of this algorithm is estimated, providing a foundation for the practical applications of this method. Then this algorithm is compared with the binary algorithm. The results show that its performance is superior to the binary BP iterative algorithm. Finally, the effects of the relevant factors such as the number of iterations selected, the structure of the check matrix etc on the algorithm performance were analyzed.