Blind recognition of RS codes based on Galois field columns Gaussian elimination

Abstract

RS (Reed Solomon) codes have strong error correction capability. The reliability of information transmission can be improved by RS codes. It is widely used in modern communication. The blind recognition of RS codes is particularly important in the field of information interception and intelligent communication. In order to solve the blind recognition problem of the high rate RS codes, this paper presents a blind recognition method of RS codes based on Galois field columns Gaussian elimination. Firstly, code length and symbolic number are recognized by using the difference function of the matrix rank. Then the primitive proved the polynomials corresponding to the number of symbol at this time are traversed. And the matrix is eliminated with columns in Galois field. By using the difference of entropy, the primitive polynomial is identified. Finally, as the code word polynomial roots are found, the continuous roots are the roots of the generator polynomial. Code length, the primitive polynomial and the generator polynomial are identified by the method. The tedious process of Galois field Fourier transform is avoided. Simulation results show that the recognition probability is higher than 90% at an error code rate of 3×10−3.