Recovering a code's length and synchronization from a noisy intercepted bitstream
暂无分享,去创建一个
[1] Sebastien Houcke,et al. Algebraic Approach for the Reconstruction of Linear and Convolutional Error Correcting Codes , 2008 .
[2] Mathieu Cluzeau,et al. Block code reconstruction using iterative decoding techniques , 2006, 2006 IEEE International Symposium on Information Theory.
[3] Robert G. Gallager,et al. Low-density parity-check codes , 1962, IRE Trans. Inf. Theory.
[4] Sébastien Houcke,et al. Blind detection of interleaver parameters , 2005, ICASSP.
[5] Anne Canteaut,et al. Attaques de cryptosystemes a mots de poids faible et construction de fonctions t-resilientes , 1996 .
[6] Antoine Valembois,et al. Detection and recognition of a binary linear code , 2001, Discret. Appl. Math..
[7] Johann Barbier. Analyse de canaux de communication dans un contexte non coopératif. (Analysis of communication channels in a non cooperative context) , 2007 .
[8] G. Burel,et al. Blind Estimation of Encoder and Interleaver Characteristics in a Non Cooperative Context , 2003 .
[9] 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 .
[10] F. Chabaud,et al. A New Algorithm for Finding Minimum-Weight Words in a Linear Code: Application to Primitive Narrow-Sense BCH Codes of Length~511 , 1995 .
[11] Christophe Chabot. Recognition of a code in a noisy environment , 2007, 2007 IEEE International Symposium on Information Theory.
[12] Jean-Pierre Tillich,et al. On the code reverse engineering problem , 2008, 2008 IEEE International Symposium on Information Theory.
[13] Antoine Joux,et al. Fast Correlation Attacks: An Algorithmic Point of View , 2002, EUROCRYPT.