The generalized Poor-Verdu error lower bound established in [1] for multihypothesis testing is studied in the classical channel coding context. It is proved that for any sequence of block codes sent over the memoryless binary symmetric channel (BSC), the minimum probability of error (under maximum likelihood decoding) has a relative deviation from the generalized bound that grows at most linearly in blocklength. This result directly implies that for arbitrary codes used over the BSC, decoder ties can only affect the subexponential behavior of the minimum probability of error.

翻译：在[1]中为多种假肢测试确立的普惠-弗尔杜普遍误差较低约束值,在古典频道编码背景下进行研究。事实证明,对于通过无内存双对称信道(BSC)发送的任何系列区块代码,最小误差概率(在最大可能性解码下)与以多线长增长的通用误差值相对偏差。这一结果直接意味着,对于BSC上使用的任意编码,解码连接只能影响最小误差概率的次荷差行为。