N. Polat Ayerden

Learn More
— We consider the problem of detection with side information to model robust signal hashing for content tracking. The receiver observes corrupted (by additive colored Gaussian noise) message signals and performs detection, knowing the noise statistics and only some partial information about the message set, which is obtained via applying a(More)
We investigate the bit-search type irregular decimation algorithms that are used within LFSR-based stream ciphers. In particular, we concentrate on BSG and ABSG, and consider two different setups for the analysis. In the first case, the input is assumed to be a m-sequence; we show that all possible output sequences can be classified into two sets, each of(More)
  • 1