The best possible upper bound on the probability of undetected error for linear codes of full support
Information Theory
2011-02-14 v1 math.IT
Abstract
There is a known best possible upper bound on the probability of undetected error for linear codes. The codes with probability of undetected error meeting the bound have support of size only. In this note, linear codes of full support () 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.
Cite
@article{arxiv.1102.2350,
title = {The best possible upper bound on the probability of undetected error for linear codes of full support},
author = {Torleiv Kløve and Jinquan Luo},
journal= {arXiv preprint arXiv:1102.2350},
year = {2011}
}