2011/02/11 by Torleiv Kløve, Kløve, Torleiv, Jinquan Luo +1
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1102.2350
arxiv created 2011/02/11 · arxiv updated 2011/02/14
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 support of size k only. In this note, linear codes of full support (=n) are studied. A best possible upper bound on the probability of undetected error for such codes is given, and the codes with probability of undetected error meeting this bound are characterized.