Binomial moments of the distance distribution: Bounds and applications

被引：0

作者：

Ashikhmin, A ^{[1
]}

Barg, A ^{[1
]}

机构：

[1] Univ Calif Los Alamos Natl Lab, Los Alamos, NM 87545 USA

来源：

1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS | 1998年

关键词：

D O I：

10.1109/ISIT.1998.709042

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

We study a combinatorial invariant of codes which counts the number of ordered pairs of codewords in all subcodes of a given support in a code. The main part of this work is related to deriving lower bounds on this invariant, both finite and asymptotic. These bounds are used to obtain new lower bounds on the probability of undetected error of binary codes on the BSC which improve previously known results. We also derive new asymptotic upper bounds on the exponent of undetected error and extend the region of code rates in which this exponent is tight.

引用

页码：437 / 437

页数：1