On Upper Bounds for Minimum Distance and Covering Radius of Non-binary Codes
On Upper Bounds for Minimum Distance and Covering Radius of Non-binary Codes
复制标题
非二进制码的最小距离和覆盖半径上界
DOI：
--
复制
发表时间：
1998
期刊：
影响因子：
--
通讯作者：
S. Litsyn
中科院分区：
文献类型：
--
作者：
T. Laihonen;S. Litsyn
我们考虑码的两个基本参数的上界：最小距离和覆盖半径。推广了S.Litsyn和A.Tietäväinen lt：Newu的一个方法，并将其与非二进制码的渐近信息率的一个新的上界相结合，得到了非二进制线性码覆盖半径的新的上界。信息率的上界是码的缩短方法的应用，是对差错概率的Shannon-Gallager-Berlekamp直线的类比。这些结果改进了目前已知的关于非二进制码在一定区间内最小距离和覆盖半径的最佳渐近上界。
We consider upper bounds on two fundamental parameters of a code; minimum distance and covering radius. New upper bounds on the covering radius of non-binary linear codes are derived by generalizing a method due to S. Litsyn and A. Tietäväinen lt:newu and combining it with a new upper bound on the asymptotic information rate of non-binary codes. The upper bound on the information rate is an application of a shortening method of a code and is an analogue of the Shannon-Gallager-Berlekamp straight line bound on error probability. These results improve on the best presently known asymptotic upper bounds on minimum distance and covering radius of non-binary codes in certain intervals.