Bounds on error probability of block codes with bounded-angle maximum-likelihood incomplete decoding

Abstract

Recently, Dolinar et al. obtained extremely tight bounds on the probabilities of decoding error and undetected error for block codes using bounded-angle maximum-likelihood (BA-ML) incomplete decoding. Unfortunately, these bounds are complex and difficult to compute for large block sizes. In this paper we obtain simple exponential upper bounds on both the word error probability and the undetected error probability of block codes using BA-ML decoding.