Information transfer through classifiers and its relation to probability of error

Fano´s (1961) bound identifies a lower bound for the classification error probability and indicates how the information transfer through classifier affects its performance. It was an important step towards linking the information theory and pattern recognition. In this paper, a family of lower bounds is derived using Renyi´s entropy, which yields Fano´s lower bound as a special case. Using a different set of entropy orders, Renyi´s definition also allows the construction a family of upper bounds for the probability of error. This is impossible using Shannon´s definition of entropy. Further analysis to obtain the tightest lower and upper bounds revealed the fact that Fano´s bound is indeed the tightest lower bound, and the upper bounds become tighter as the entropy order approaches to one from below. Numerical evaluations of the bounds are presented for three digital modulation schemes under AWGN channel