Extended binomial moments of a linear code and the undetected error probability
This paper introduces and studies the extended binomial moments of a linear code \(C\). Equalities relating the extended binomial moments of \(C\) and \(C^\perp\) have been derived. These lead to strict lower and upper bounds on the remaining nonzero extended binomial moments, and to a refinement of known inequalities between binomial moments, further leading to a simple algorithm for computing the code distance of \(C^\perp\) via the extended binomial moments of \(C\). The author further studies the probability of undetected error of \(C\) when the code is used for error detection on a symmetric channel. As a consequence, he derives a lower bound on the undetected error probability involving the basic code parameters and the number of minimum-weight codewords, and proves that the bound is attained by the near MDS and MMD codes.
- Binomial moments of the distance distribution: bounds and applications
- Undetected error probability of \(q\)-ary constant weight codes
- Binomial moments of the distance distribution and the probability of undetected error.
- Bounds on the undetected error probabilities of linear codes for both error correction and detection
- On the undetected error probability for binary codes
- Undetected error probability of \(q\)-ary constant weight codes
- On the Subexponential Decay of Detection Error Probabilities in Long Tandems
- Binomial moments of the distance distribution: bounds and applications
- Моментные характеристики весов векторов в случайных двоичных линейных кодах
- A survey on proper codes
This page was built for publication: Extended binomial moments of a linear code and the undetected error probability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487096)
