Investigation of the Properties of an Optimal Reception Algorithm for Binary Signals

We consider the optimal processing of binary symbols generated by a Markov source and transmitted by a channel with memory modeled by a two-state probabilistic automaton. We derive the upper and lower bounds on error probability of symbol-by-symbol reception optimal the sense of the ideal observer criterion. A bound on the potentially attainable reception accuracy is given and the conditions of singleton decoding are derived.