Recovering a Code's Length and Synchronisation from a Noisy Intercepted Bitstream
Abstract
We focus on the problem of recovering the length and synchronization of a linear block code from an intercepted bitstream. We place ourselves in an operational context where the intercepted bitstream contains a realistic noise level. We present two algorithms, both useful in different contexts, able to verify if a given length/synchronization is correct. Using them, we were able to practically recover the synchronization of several codes.
Origin : Files produced by the author(s)
Loading...