A New Method for BCH Codes of Blind Recognition

Lan Xun Wang; Dan Fang Li

doi:10.4028/www.scientific.net/AMR.631-632.1403

Paper Titles

The Application of Computer Software — 3D Studio Max, Lightscape and V-Ray in the Environmental Artistic Expression
p.1379

A New Approach of Computer Forensics Based on Steganalysis
p.1385

Research about Information Security Risk Assessment of Oil and Gas Production Management System
p.1390

Fast Algorithms for Computing Composite-Number-Less-Than-20-Point DFT
p.1397

A New Method for BCH Codes of Blind Recognition
p.1403

A Secure Strategy for Location-Based Wireless Sensor Networks
p.1409

An Efficient Pre-Processing Algorithm for Removing Uniform Noise Based on Cluster Method
p.1416

Study of the Technology to Design the Role Model Based on the Outline
p.1423

Design and Construct for Non-Isomorphism Block
p.1427

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 631-632A New Method for BCH Codes of Blind Recognition

A New Method for BCH Codes of Blind Recognition

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.

You might also be interested in these eBooks

Materials Engineering for Advanced Technologies (ICMEAT 2012)

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 631-632)

Pages:

1403-1408

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.631-632.1403

Citation:

Cite this paper

Online since:

January 2013

Authors:

Lan Xun Wang, Dan Fang Li

Keywords:

BCH Code, Blind Recognition, Greatest Common Factor, Sum Function

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] XUE Guoqing. Blind identification of convolutional codes[D]. Hefei: University of Science and Technology of China, (2009).

Google Scholar

[2] ZAN Junjun, LI Yanbin. Blind recognition of low code rate binary linear block codes [J]. Radio Engineering, 2009, 39(1): 19-24.

Google Scholar

[3] LIU Jing. Research on recognition technology for convolutional codes and cyclic codes[D]. Xian: Xidian University, (2010).

Google Scholar

[4] WEN Niancheng, YANG Xiaojing. Blind recognition of cyclic codes based on rank statistic and codes roots characteristic[J]. Electronic Information Warfare Technology, 2010，25(6): 26-29.

Google Scholar

[5] WANG Xinmei. Error correcting code-principles and methods[M]. Xian: Xidian University Press, (2002).

Google Scholar

[6] QI Lin, HAO Shiqi, WANG Lei. A fast blind recognition method of RS codes [J]. Journal of Circuits and Systems, 2011，16(2): 70-76.

Google Scholar

[7] C. Chritophe, Recognition of a code in a noisy environment. IEEE International Symposium on Information Theory, 2007, pp: 2211-2215.

Google Scholar