|
Problemy Peredachi Informatsii, 1998, Volume 34, Issue 3, Pages 32–36
(Mi ppi414)
|
|
|
|
Coding Theory
Binary Constant-Weight Codes of Weight One Correcting Localized Errors
V. S. Lebedev
Abstract:
New bounds on the maximum number of messages that can be transmitted using a constant-weight code of length $n$ and weight 1 correcting $t$ localized errors are obtained. A connection between these codes and tournaments is established.
Received: 08.04.1997 Revised: 07.04.1998
Citation:
V. S. Lebedev, “Binary Constant-Weight Codes of Weight One Correcting Localized Errors”, Probl. Peredachi Inf., 34:3 (1998), 32–36; Problems Inform. Transmission, 34:3 (1998), 233–237
Linking options:
https://www.mathnet.ru/eng/ppi414 https://www.mathnet.ru/eng/ppi/v34/i3/p32
|
Statistics & downloads: |
Abstract page: | 241 | Full-text PDF : | 90 | References: | 34 |
|