Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Levenshtein, Vladimir Iosifovich
Statistics Math-Net.Ru
Total publications: 23
Scientific articles: 23

Number of views:
This page:1442
Abstract pages:20414
Full texts:8470
References:212
E-mail:

https://www.mathnet.ru/eng/person29853
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/209871

Publications in Math-Net.Ru Citations
2007
1. V. I. Levenshtein, “Conflict-Avoiding Codes and Cyclic Triple Systems”, Probl. Peredachi Inf., 43:3 (2007),  39–53  mathnet  mathscinet  zmath; Problems Inform. Transmission, 43:3 (2007), 199–212  isi  scopus 27
1997
2. V. I. Levenshtein, “Reconstruction of objects from the minimum number of distorted patterns”, Dokl. Akad. Nauk, 354:5 (1997),  593–596  mathnet  mathscinet  zmath
1995
3. V. I. Levenshtein, “A Simple Proof of the Main Inequalities for Fundamental Parameters of Codes in Polynomial Association Schemes”, Probl. Peredachi Inf., 31:4 (1995),  37–50  mathnet  mathscinet  zmath; Problems Inform. Transmission, 31:4 (1995), 325–336
1991
4. V. I. Levenshtein, “Perfect codes in the metric of deletions and insertions”, Diskr. Mat., 3:1 (1991),  3–20  mathnet  mathscinet  zmath; Discrete Math. Appl., 2:3 (1992), 241–258 3
1989
5. V. I. Levenshtein, “On the Straight-Line Bound for the Undetected Error Exponent”, Probl. Peredachi Inf., 25:1 (1989),  33–37  mathnet  mathscinet  zmath; Problems Inform. Transmission, 25:1 (1989), 24–27 5
1982
6. V. I. Levenshtein, “Bounds of the maximal capacity of a code with a limited scalar product modulus”, Dokl. Akad. Nauk SSSR, 263:6 (1982),  1303–1308  mathnet  mathscinet 1
1979
7. V. I. Levenshtein, “On bounds for packings in $n$-dimensional Euclidean space”, Dokl. Akad. Nauk SSSR, 245:6 (1979),  1299–1303  mathnet  mathscinet  zmath 11
1978
8. G. A. Kabatiansky, V. I. Levenshtein, “On Bounds for Packings on a Sphere and in Space”, Probl. Peredachi Inf., 14:1 (1978),  3–25  mathnet  mathscinet  zmath; Problems Inform. Transmission, 14:1 (1978), 1–17 27
1977
9. V. I. Levenshtein, “Bounds on the Probability of Undetected Error”, Probl. Peredachi Inf., 13:1 (1977),  3–18  mathnet  mathscinet  zmath; Problems Inform. Transmission, 13:1 (1977), 1–12 3
1975
10. V. I. Levenshtein, “Maximal packing density of $n$-dimensional Euclidean space with equal balls”, Mat. Zametki, 18:2 (1975),  301–311  mathnet  mathscinet  zmath; Math. Notes, 18:2 (1975), 765–771 7
1974
11. V. I. Levenshtein, “Minimum Redundancy of Binary Error-Correcting Codes”, Probl. Peredachi Inf., 10:2 (1974),  26–42  mathnet  mathscinet  zmath; Problems Inform. Transmission, 10:2 (1974), 110–123
1971
12. V. I. Levenshtein, “Upper-Bound Estimates for Fixed-Weight Codes”, Probl. Peredachi Inf., 7:4 (1971),  3–12  mathnet  zmath; Problems Inform. Transmission, 7:4 (1971), 281–287 5
13. V. I. Levenshtein, “One Method of Constructing Quasilinear Codes Providing Synchronization in the Presence of Errors”, Probl. Peredachi Inf., 7:3 (1971),  30–40  mathnet  mathscinet  zmath; Problems Inform. Transmission, 7:3 (1971), 215–222 2
1970
14. V. I. Levenshtein, “Maximum Number of Words in Codes without Overlaps”, Probl. Peredachi Inf., 6:4 (1970),  88–90  mathnet  mathscinet  zmath; Problems Inform. Transmission, 6:4 (1970), 355–357 2
1969
15. V. I. Levenshtein, “Bounds for Codes Ensuring Error Correction and Synchronization”, Probl. Peredachi Inf., 5:2 (1969),  3–13  mathnet  mathscinet  zmath; Problems Inform. Transmission, 5:2 (1979), 1–10 1
1968
16. V. I. Levenshtein, “On the Synchronization of Two-Way Networks of Automata”, Probl. Peredachi Inf., 4:4 (1968),  49–62  mathnet  mathscinet  zmath; Problems Inform. Transmission, 4:4 (1968), 40–51
1965
17. V. I. Levenshtein, “Binary codes capable of correcting deletions, insertions, and reversals”, Dokl. Akad. Nauk SSSR, 163:4 (1965),  845–848  mathnet  mathscinet  zmath 28
18. V. I. Levenshtein, “On a Method of Solving the Problem of Synchronizing a Chain of Automata in Minimal Time”, Probl. Peredachi Inf., 1:4 (1965),  20–32  mathnet  zmath; Problems Inform. Transmission, 1:4 (1965), 14–25
19. V. I. Levenshtein, “Binary codes with correction for deletions and insertions of the symbol 1”, Probl. Peredachi Inf., 1:1 (1965),  12–25  mathnet  mathscinet  zmath 4
1962
20. V. I. Levenshtein, “The inversion of finite automata”, Dokl. Akad. Nauk SSSR, 147:6 (1962),  1300–1303  mathnet  mathscinet  zmath 1
1961
21. V. I. Levenshtein, “Self-adaptive automata for decoding messages”, Dokl. Akad. Nauk SSSR, 141:6 (1961),  1320–1323  mathnet  mathscinet  zmath 2
22. V. I. Levenshtein, “Certain properties of code systems”, Dokl. Akad. Nauk SSSR, 140:6 (1961),  1274–1277  mathnet  mathscinet  zmath
1960
23. V. I. Levenshtein, “A class of systematic codes”, Dokl. Akad. Nauk SSSR, 131:5 (1960),  1011–1014  mathnet  mathscinet  zmath

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024