Recently, Dolinar et al. [1] 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 axe 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.
展开▼
