The best possible upper bound on the probability of undetected error for linear codes of full support

Torleiv Kløve, Jinquan Luo

There is a known best possible upper bound on the probability of undetected error for linear codes. The $[n,k;q]$ codes with probability of undetected error meeting the bound have…