JPR_V3_N4_RP3 A.Abhishek Nath K. Bhaskar Reddy Somesula Sivasagar Journal on Pattern Recognition 2350-112X 3 4 16 21 BCH Codes, Galois Field Fourier Transform (GFFT), Blind Recognition, Binary Symmetric Channel (BSC), Generator Polynomial, Optimal Threshold In this paper, a novel method Galois Field Fourier Transform has been proposed for extracting the primitive Bose-Chaudhuri- Hocquenghem (BCH) Code which is intercepted with the noise. Firstly, the intercepted bit stream is divided into sequences of the same length and GFFT is performed on all the sequences, from which spectral components are recorded. Then, based on the locations of common null spectral components, the code length and the roots of respective generator polynomial are found. Finally, the performance of proposed technique is measured by computing the false alarm and miss detection probabilities for both roots and non-roots of the Generator Polynomial. The code recognition of the proposed method is plotted for different code lengths and also compared with previous techniques. December 2016 - February 2017 Copyright © 2017 i-manager publications. All rights reserved. i-manager Publications http://www.imanagerpublications.com/Article.aspx?ArticleId=13539