Abstract
We have recently proposed a problem about blind recognition of binary primitive BCH Codes. A model was established based on the polynomial roots statistic of finite fields. The roots probabilities of BCH codes were analyzed and the recognition method for binary BCH codes based on polynomial roots statistic of finite fields was proposed. In the paper we showed that the binary primitive BCH Codes could be completely recognized in theoretical analysis and simulation experiment showed the better performance of the recognition method though in high BER.
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.
