• A. SUBHASH DEEPTHI
• E. V. NARAYANA

A solution to blind reconstruction of binary cyclic codes is proposed here. Here we consider the problem of finding unknown length of channel codes from unsynchronized bit stream. For this we identify the correct synchronization, length and factors of the generator polynomial of the code. It is used in military surveillance applications to identify the channel code used by an adversary. Towards this we study the distribution of the syndromes of the received polynomials with respect to a candidate factors of the generator polynomial. Also we prove that the probability of zero syndrome is maximum. Using this result the problem of blind reconstruction of cyclic codes is formulated and solved as a hypothesis testing problem. In this paper MATLAB15.0 is used

blind reconstruction, candidate factor, channel codes, cyclic codes

"CYCLIC CODES RECONSTRUCTION FROM UNSYNCHRONIZED BITSREAM WITH GAUSSIAN NOISE", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 7, page no.192-195, July-2018, Available :http://www.jetir.org/papers/JETIR1807184.pdf

"CYCLIC CODES RECONSTRUCTION FROM UNSYNCHRONIZED BITSREAM WITH GAUSSIAN NOISE", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 7, page no. pp192-195, July-2018, Available at : http://www.jetir.org/papers/JETIR1807184.pdf