The worst case probability of undetected error for linear codes on the local binomial channel
Torleiv Kløve · IEEE Transactions on Information Theory · 1996
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 is determined explicitly for some classes of codes.