Bounds on the Probability of Undetected Error for <i>q</i>-Ary Codes

Abstract

We study the probability of an undetected error for general q-ary codes. We give upper and lower bounds on this quantity, by the Linear Programming and the Polynomial methods, as a function of the length, size, and minimum distance. Sharper bounds are obtained in the important special case of binary Hamming codes. Finally, several examples are given to illustrate the results of this paper.

Keywords

• error correcting codes
• probability of undetected error
• linear programmming