Most of existing methods to identify the Reed-solomon (RS) codes, commonly applied as channel codes, mainly focus on non-shortened RS codes. In this paper, a method to identify the shortened RS codes with short codeword length is proposed. Firstly, based on Gauss-Jordan elimination through pivoting (GJETP), the codeword length of shortened RS codes is identified. The shortened RS codewords are zeroized by estimating the order of finite field and the number of shortened symbols. Then, the Chinese remainder theorem(CRT) based algorithm is adopted to identify the primitive polynomial. Finally, the generator polynomial is obtained based on Galois field Fourier transform (GFFT). The simulation experiments are carried out showing that the probability of recognition of shortened RS codes is higher than 90% with bit error rate (BER) less than 5×10<sup>-3</sup> , which demonstrates the viability of the proposed recognition approach.