Summary
The 2018 International Symposium on Information Theory and Its Applications　(ISITA2018)
2018
Session Number:Tu-AM-1-1
Session:
Number:Tu-AM-1-1.5
Blind Reconstruction of Binary Cyclic Codes over Binary Erasure Channel
Arti D. Yardi,
pp.301-305
Publication Date:2018/10/18
Online ISSN:2188-5079
DOI:10.34385/proc.55.Tu-AM-1-1.5
PDF download
Summary:
Given a sequence of noise-affected codewords of an unknown channel code, the problem of blind reconstruction of channel codes consists of identifying this unknown channel code. This problem has many applications in military surveillance and cognitive radios. In this paper, we study this problem for the case when the noise is introduced by the binary erasure channel (BEC) and the unknown channel code is a binary cyclic code of known length. We provide an algorithm to find the generator polynomial of the unknown cyclic code. We also provide an analysis of our algorithm where we provide a lower bound on the probability of correctly identifying the factors of the generator polynomial.