Abstract
According to the invariance property of the BCH code and Euclidean algorithm to calculate the greatest common factor (GCF) between code group and its cyclic shift code group. There is a method by using the degree distribution probability sum function of the greatest common factor to recognize the code length of BCH code. On this basis, the GCF can be extracted of the greatest degree distribution probability from the sum function, with the generator polynomial obtained by decomposing the GCF. The simulation results show that this method can achieve the recognition probability above 95% with BER of 4×10-3，and the high BER is much better to recognize the short codes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
