|
Problemy Peredachi Informatsii, 2003, Volume 39, Issue 3, Pages 28–39
(Mi ppi306)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
Information Theory and Coding Theory
The Extended Binomial Moments of a Linear Code and the Undetected Error Probability
R. D. Dodunekova Department of Mathematical Sciences, Chalmers University of Technology and the University of Göteborg
Abstract:
Extended binomial moments of a linear code, introduced in this paper, are synonymously related to the code weight distribution and linearly to its binomial moments. In contrast to the latter, the extended binomial moments are monotone, which makes them appropriate for studying the undetected error probability. We establish some properties of the extended binomial moments and, based on this, derive new lower and upper bounds on the probability of undetected error. Also, we give a simplification of some previously obtained sufficient conditions for proper and good codes, stated in terms of the extended binomial moments.
Received: 03.06.2002 Revised: 28.01.2003
Citation:
R. D. Dodunekova, “The Extended Binomial Moments of a Linear Code and the Undetected Error Probability”, Probl. Peredachi Inf., 39:3 (2003), 28–39; Problems Inform. Transmission, 39:3 (2003), 255–265
Linking options:
https://www.mathnet.ru/eng/ppi306 https://www.mathnet.ru/eng/ppi/v39/i3/p28
|
Statistics & downloads: |
Abstract page: | 437 | Full-text PDF : | 133 | References: | 63 |
|