|
Problemy Peredachi Informatsii, 1970, Volume 6, Issue 4, Pages 88–90
(Mi ppi1773)
|
|
|
|
This article is cited in 2 scientific papers (total 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.
Received: 06.08.1970
Citation:
V. I. Levenshtein, “Maximum Number of Words in Codes without Overlaps”, Probl. Peredachi Inf., 6:4 (1970), 88–90; Problems Inform. Transmission, 6:4 (1970), 355–357
Linking options:
https://www.mathnet.ru/eng/ppi1773 https://www.mathnet.ru/eng/ppi/v6/i4/p88
|
|