RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 1971 Volume 7, Issue 4, Pages 3–12 (Mi ppi1656)

This article is cited in 5 papers

Coding Theory

Upper-Bound Estimates for Fixed-Weight Codes

V. I. Levenshtein


Abstract: New upper bounds are obtained for the maximum number of binary vectors having a fixed number of unit symbols and forming a code with a specified code distance. The resulting estimates lead to more precise asymptotic relations than the corresponding estimates of Johnson and Berger and permit Johnson's estimate to be analyzed for arbitrary codes.

UDC: 621.391.15

Received: 30.09.1970


 English version:
Problems of Information Transmission, 1971, 7:4, 281–287

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025