全支集线性码不可检错误概率的最佳可能上界
The best possible upper bound on the probability of undetected error for linear codes of full support
摘要：
线性码的不可检测错误概率有一个已知的最佳可能上限。未检测到错误的概率满足该界的$[n,k;q]$码仅具有大小$k$的支持。本文研究了全支撑线性码（$=n$）.给出了这类码的不可检错误概率的一个最佳可能上界，并刻画了不可检错误概率满足此上界的码。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
