Some properties of one of the classifed binary BCH code
Liao Chun-sheng
Abstract
Liao Chun-sheng
Abstract
In this paper,we discuss some properties of classified(2m-1,2m-mt-1) BCH code and find their relationship with the Hamming code and the characteristics of the generator polynomial.Furthermore,we use the method of Chien search to list some representatives of this kind of code,these codes are no better than the complete code.So they are worthy of being studied.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper,we discuss some properties of classified(2m-1,2m-mt-1) BCH code and find their relationship with the Hamming code and the characteristics of the generator polynomial.Furthermore,we use the method of Chien search to list some representatives of this kind of code,these codes are no better than the complete code.So they are worthy of being studied.
Key concepts: BCH code, Polynomial code, Code (set theory), Hamming code, Hamming bound, Computer science, Constant-weight code, Cyclic code