Levenshtein Vladimir Iosifovich

Publications in Math-Net.Ru

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