|
Problemy Peredachi Informatsii, 1969, Volume 5, Issue 2, Pages 3–13
(Mi ppi1793)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Bounds for Codes Ensuring Error Correction and Synchronization
V. I. Levenshtein
Abstract:
The order is established for the maximum number of binary words in codes ensuring correction of a given number of errors and synchronization of code words.
Received: 06.05.1968
Citation:
V. I. Levenshtein, “Bounds for Codes Ensuring Error Correction and Synchronization”, Probl. Peredachi Inf., 5:2 (1969), 3–13; Problems Inform. Transmission, 5:2 (1979), 1–10
Linking options:
https://www.mathnet.ru/eng/ppi1793 https://www.mathnet.ru/eng/ppi/v5/i2/p3
|
Statistics & downloads: |
Abstract page: | 349 | Full-text PDF : | 154 |
|