Blind Recognition of Binary Primitive BCH Codes Based on Polynomial Roots Statistic of Finite Fields

DOI

10.2991/iccsae-15.2016.98How to use a DOI?

Keywords

finite fields; polynomial roots; BCH code; blind recognition.

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.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xinran Zhang
AU  - XiaoJing Yang
AU  - Yuehua Dai
PY  - 2016/02
DA  - 2016/02
TI  - Blind Recognition of Binary Primitive BCH Codes Based on Polynomial Roots Statistic of Finite Fields
BT  - Proceedings of the 2015 5th International Conference on Computer Sciences and Automation Engineering
PB  - Atlantis Press
SP  - 529
EP  - 533
SN  - 2352-538X
UR  - https://doi.org/10.2991/iccsae-15.2016.98
DO  - 10.2991/iccsae-15.2016.98
ID  - Zhang2016/02
ER  -