Abstract: Based on decoding algorithms available nowadays, a high efficiency decoding algorithm for nonbinary low-density parity-check codes is proposed. The algorithm takes advantage of both the layered decoding algorithm and the Min-max algorithm, which not only achieves the low complexity and the low memory requirement, but also speeds up the decoding by two times. Simulations for a (620,509) code over GF(25) show that with the same bit error rate, the maximum iteration times of the proposed algorithm required is just 45% of Zhangs algorithm presented in 2011.