Properties of syndrome distribution for blind reconstruction of cyclic codes

In the problem of blind reconstruction of channel codes, the receiver does not have the knowledge of the channel code used at the transmitter and the aim is to identify this unknown code from the received data. For the case of cyclic codes, typical blind reconstruction methods make use of some elementary properties of syndromes (remainders) of the received polynomials. The main aim of this paper is to provide a detailed analysis of the properties of the syndromes that could be useful to design more efficient blind reconstruction methods. Specifically, we prove that the syndrome distribution of the noise-free sequence can be either degenerate or uniform or restricted uniform. We also provide necessary and sufficient conditions for the syndrome distribution to be of a given type. For the noise-affected received sequence we identify additional structural properties exhibited by the syndrome distribution. Finally, we apply these results to analyze the performance of the existing blind reconstruction methods.

[1]  Arti D. Yardi,et al.  Channel-code detection by a third-party receiver via the likelihood ratio test , 2014, 2014 IEEE International Symposium on Information Theory.

[2]  Roland Gautier,et al.  Classification Based on Euclidean Distance Distribution for Blind Identification of Error Correcting Codes in Noncooperative Contexts , 2018, IEEE Transactions on Signal Processing.

[3]  Stanislav Bulygin,et al.  Codes, Cryptology and Curves with Computer Algebra , 2017 .

[4]  Giovanni Cancellieri,et al.  Polynomial Theory of Error Correcting Codes , 2014 .

[5]  Nicolas Sendrier,et al.  Reconstruction of a turbo-code interleaver from noisy observation , 2010, 2010 IEEE International Symposium on Information Theory.

[6]  Hyun Lee,et al.  Reconstruction of BCH codes using probability compensation , 2012, 2012 18th Asia-Pacific Conference on Communications (APCC).

[7]  Jean-Pierre Tillich,et al.  Identifying an unknown code by partial Gaussian elimination , 2019, Des. Codes Cryptogr..

[8]  W. Cary Huffman,et al.  Fundamentals of Error-Correcting Codes , 1975 .

[9]  H. Niederreiter,et al.  Introduction to finite fields and their applications: Factorization of Polynomials , 1994 .

[10]  Anne Canteaut,et al.  A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to McEliece’s Cryptosystem and to Narrow-Sense BCH Codes of Length , 1998 .

[11]  Arti D. Yardi,et al.  Blind Reconstruction of Binary Cyclic Codes , 2014 .

[12]  Daniel D. Sullivan.  A fundamental inequality between the probabilities of binary subgroups and cosets , 1967, IEEE Trans. Inf. Theory.

[13]  Sébastien Houcke,et al.  Blind detection of interleaver parameters , 2005, Proceedings. (ICASSP '05). IEEE International Conference on Acoustics, Speech, and Signal Processing, 2005..

[14]  Jing Zhou,et al.  Blind recognition of binary cyclic codes , 2013, EURASIP J. Wirel. Commun. Netw..

[15]  Johann Barbier,et al.  Reconstruction of turbo-code encoders , 2005, SPIE Defense + Commercial Sensing.

[16]  Zhou Jing,et al.  Blind recognition of binary cyclic codes , 2013 .

[17]  Elwyn R. Berlekamp,et al.  On the inherent intractability of certain coding problems (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[18]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[19]  Daeyoung Park,et al.  Coordinating transmit power and carrier phase for wireless networks with multi-packet reception capability , 2013, EURASIP J. Wirel. Commun. Netw..

[20]  Erik G. Larsson,et al.  Fast Blind Recognition of Channel Codes , 2014, IEEE Transactions on Communications.

[21]  Eric Filiol.  Reconstruction of Convolutional Encoders over GF(q) , 1997, IMACC.

[22]  Roland Gautier,et al.  Blind recovery of k/n rate convolutional encoders in a noisy environment , 2011, EURASIP J. Wirel. Commun. Netw..

[23]  G. Burel,et al.  Blind Estimation of Encoder and Interleaver Characteristics in a Non Cooperative Context , 2003 .

[24]  Christophe Chabot.  Reconnaissance de codes, structure des codes quasi-cycliques , 2009 .

[25]  Christophe Chabot.  Recognition of a code in a noisy environment , 2007, 2007 IEEE International Symposium on Information Theory.

[26]  Shu Lin,et al.  Error Control Coding , 2004 .

[27]  Johann Barbier,et al.  Forward error correcting codes characterization based on rank properties , 2009, 2009 International Conference on Wireless Communications & Signal Processing.

[28]  Matthieu Finiasz,et al.  Recovering a code's length and synchronization from a noisy intercepted bitstream , 2009, 2009 IEEE International Symposium on Information Theory.

[29]  Jing Zhou,et al.  Information-Dispersion-Entropy-Based Blind Recognition of Binary BCH Codes in Soft Decision Situations , 2013, Entropy.

[30]  Janis Dingel,et al.  Parameter Estimation of a Convolutional Encoder from Noisy Observations , 2007, 2007 IEEE International Symposium on Information Theory.

[31]  Arti D. Yardi,et al.  Blind Reconstruction of Binary Cyclic Codes From Unsynchronized Bitstream , 2016, IEEE Transactions on Communications.

[32]  Dong-Joon Shin,et al.  Blind Reconstruction of BCH Codes Based on Consecutive Roots of Generator Polynomials , 2018, IEEE Communications Letters.

[33]  H. Vincent Poor,et al.  An introduction to signal detection and estimation (2nd ed.) , 1994 .

[34]  A. S. Madhukumar,et al.  Blind Reconstruction of Reed-Solomon Encoder and Interleavers Over Noisy Environment , 2018, IEEE Transactions on Broadcasting.

[35]  Antoine Valembois,et al.  Detection and recognition of a binary linear code , 2001, Discret. Appl. Math..

[36]  Arti D. Yardi.  Blind Reconstruction of Binary Cyclic Codes over Binary Erasure Channel , 2018, 2018 International Symposium on Information Theory and Its Applications (ISITA).

[37]  Mathieu Cluzeau,et al.  Block code reconstruction using iterative decoding techniques , 2006, 2006 IEEE International Symposium on Information Theory.

[38]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .