论文信息 - Detecting linear block codes in noise using the GLRT

Detecting linear block codes in noise using the GLRT

In this paper, we consider the problem of distinguishing the noisy codewords of a known binary linear block code from a random bit sequence. We propose to use the generalized likelihood ratio test (GLRT) to solve this problem. We also give a formula to find approximate number of codewords required and compare our results with an existing method.

Arti D. Yardi | Saravanan Vijayakumaran | S. Vijayakumaran

[1] J. Andel. Sequential Analysis , 2022, The SAGE Encyclopedia of Research Design.

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

[3] 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 .

[4] H. Vincent Poor,et al. An Introduction to Signal Detection and Estimation , 1994, Springer Texts in Electrical Engineering.

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

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

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

[8] Rodrigue Imad,et al. Blind frame synchronization for error correcting codes having a sparse parity check matrix , 2009, IEEE Transactions on Communications.

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

[10] L. Litwin,et al. Error control coding , 2001 .

[11] M. Ozeki,et al. Complete coset weight distributions of second order Reed-Muller code of length 64 , 2011 .