|
This article is cited in 1 scientific paper (total in 1 paper)
Coding Theory
On lower bounds on the spectrum of a binary code
M. V. Burnashev Kharkevich Institute for Information Transmission Problems,
Russian Academy of Sciences, Moscow, Russia
Abstract:
We refine a lower bound on the spectrum of a binary code. We give a simple derivation of the known bound on the undetected error probability of a binary code.
Keywords:
spectrum of a binary code, constant-weight code, undetected error probability.
Received: 11.09.2019 Revised: 05.11.2019 Accepted: 12.11.2019
Citation:
M. V. Burnashev, “On lower bounds on the spectrum of a binary code”, Probl. Peredachi Inf., 55:4 (2019), 76–85; Problems Inform. Transmission, 55:4 (2019), 366–375
Linking options:
https://www.mathnet.ru/eng/ppi2304 https://www.mathnet.ru/eng/ppi/v55/i4/p76
|
Statistics & downloads: |
Abstract page: | 189 | Full-text PDF : | 28 | References: | 23 | First page: | 15 |
|