Abstract: In order to solve the problem of the blind recognition of channel coding, some methods of blind recognition of Reed-Solomon (RS) coding are proposed. In the case of codes without errors, the coded length, primitive polynomial, and generator polynomial are obtained based on reduced row echelon form of the matrix (RREF). In the case of codes with errors, the coded length, primitive polynomial, and generator polynomial are obtained based on RREF, fault-tolerant matrix decomposing (FTMD) and Galois Field Fourier Transform (GFFT). The simulation experiments show that the recognition probability of the proposed methods is above 85% at a bit error rate (BER) of 10?3.