RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 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.

UDC: 621.391.15

Received: 08.04.1997
Revised: 07.04.1998


 English version: Problems of Information Transmission, 1998, 34:3, 233–237

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024