The worst-case probability of undetected error for a linear [n,k;q] code used on a local binomial channel is studied. For the two most important cases it is determined in terms of the weight hierarchy of the code. The worst-case probability of undetected error for simplex codes is determined explicitly. A conjecture about Hamming codes is given.
['Torleiv Kløve']
The worst case probability of undetected error for linear codes on the local binomial channel