Universal detection of messages via finite-state channels
We propose a universal, asymptotically optimum decision rule fur 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.
finite-state channels neyman-pearson lempel-ziv algorithm universal decoding watermarking