Universal detection of messages via finite-state channels
暂无分享,去创建一个
We propose a universal, asymptotically optimum decision rule for deciding whether or not an observed sequence generated at the output of an unknown finite-state channel corresponds to a given channel-input message. The hypothesized message is tested against a certain alternative message or several alternative messages under the Neyman-Pearson criterion.
[1] Neri Merhav,et al. Estimating the number of states of a finite-state source , 1992, IEEE Trans. Inf. Theory.
[2] Rudolf Ahlswede,et al. Identification via channels , 1989, IEEE Trans. Inf. Theory.
[3] Jacob Ziv,et al. Universal decoding for finite-state channels , 1985, IEEE Trans. Inf. Theory.
[4] Abraham Lempel,et al. Compression of individual sequences via variable-rate coding , 1978, IEEE Trans. Inf. Theory.