The best possible upper bound on the probability of undetected error for linear codes of full support
classification
💻 cs.IT
math.IT
keywords
codesbounderrorprobabilityundetectedbestlinearpossible
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.