Order Statistics on Minimal Euclidean Distance for Blind Linear Block Code Identification - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

Order Statistics on Minimal Euclidean Distance for Blind Linear Block Code Identification

Résumé

This article deals with the blind detection and identification of error correcting codes. More precisely, we aim at estimating the code length from a noisy bits stream in a non-cooperative context (e.g. Electronic Warfare). In this context, an eavesdropper may intercept a communication. To retrieve the sent information, one can consider identifying the channel code parameters. The method proposed here relies on a statistical analysis of a Euclidean distance matrix. It allows to estimate the code length. We address a process based on soft bits information with no a priori on the encoder used. Finally, we compare our method with a well known algorithm based on Gauss-Jordan elimination.
Fichier non déposé

Dates et versions

hal-01759075 , version 1 (05-04-2018)

Identifiants

Citer

Aurélien Bonvard, Sébastien Houcke, Mélanie Marazin, Roland Gautier. Order Statistics on Minimal Euclidean Distance for Blind Linear Block Code Identification. ICC 2018 : IEEE International Conference on Communications, May 2018, Kansas City, United States. ⟨10.1109/ICC.2018.8422347⟩. ⟨hal-01759075⟩
115 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More