RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 1970 Volume 6, Issue 4, Pages 88–90 (Mi ppi1773)
This article is cited in 2 papers

Ņorrespondence

Maximum Number of Words in Codes without Overlaps

V. I. Levenshtein


Abstract: The upper bound for the maximum number of words in block codes without overlaps is improved, and the asymptotic behavior of the redundancy of denumerable codes without overlaps is studied.

UDC: 621.395.15

Received: 06.08.1970


 English version: Problems of Information Transmission, 1970, 6:4, 355–357

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2025