关键词: BCH码, 生成多项式, 有限域, 快速识别

Abstract:

In order to get the error-correcting codes information of the unknown lines in digital communication, a novel method of fast detection BCH generator polynomial is presented. The length of binary primitive BCH codes is recognized by the roots information dispersion entropy idea. Then, on the basis of the isomorphic principle of finite fields, the BCH generator polynomial is gained directly through multiplication and simplification in finite fields with the roots obtained before. The novel method can avoid the calculational and temporal complexity brought by searching the primitive polynomial in the existing algorithms observably. The experimental result shows that the fast recognition method is valid.

Key words: BCH codes, generator polynomial, finite fields, fast recognition