From Chapman-Robbins bound towards Barankin bound in threshold behaviour prediction

The evolution of the Barankin bound and the threshold behaviour occurrence with the number of test points for which the bias is constrained to be null is studied. It is first shown that the Barankin bound is an increasing function of the number of test points used in its computation. This result is further used to characterise the threshold occurrence evolution with the number of test points.