Kabatiansky Grigorii Anatol'evich

Publications in Math-Net.Ru

1. Codes for exact support recovery of sparse vectors from inaccurate linear measurements and their decoding
   
   Probl. Peredachi Inf., 59:1 (2023),  17–24
2. Nonoverlapping convex polytopes with vertices in a Boolean cube and other problems in coding theory
   
   Probl. Peredachi Inf., 58:4 (2022),  50–61
3. Separable collusion-secure multimedia codes
   
   Probl. Peredachi Inf., 57:2 (2021),  90–111
4. Existence and construction of complete traceability multimedia fingerprinting codes resistant to averaging attack and adversarial noise
   
   Probl. Peredachi Inf., 56:4 (2020),  97–108
5. Traceability codes and their generalizations
   
   Probl. Peredachi Inf., 55:3 (2019),  93–105
6. On metric dimension of nonbinary Hamming spaces
   
   Probl. Peredachi Inf., 54:1 (2018),  54–62
7. On error correction with errors in both the channel and syndrome
   
   Probl. Peredachi Inf., 51:2 (2015),  50–56
8. Контактные числа, коды и сферические многочлены
   
   Mat. Pros., Ser. 3, 16 (2012),  57–74
9. Coverings, centered codes, and combinatorial steganography
   
   Probl. Peredachi Inf., 45:3 (2009),  106–111
10. List Decoding of Binary First-Order Reed-Muller Codes
    
    Probl. Peredachi Inf., 43:3 (2007),  66–74
11. Codes for Copyright Protection: The Case of Two Pirates
    
    Probl. Peredachi Inf., 41:2 (2005),  123–127
12. On Pair-Separating Codes
    
    Probl. Peredachi Inf., 37:4 (2001),  60–62
13. Математика разделения секрета
    
    Mat. Pros., Ser. 3, 2 (1998),  115–126
14. Generalized Ideal Secret-Sharing Schemes and Matroids
    
    Probl. Peredachi Inf., 33:3 (1997),  102–110
15. Difference Sets and Codes Correcting Single Localized Errors of Known Value
    
    Probl. Peredachi Inf., 32:2 (1996),  31–35
16. Construction of Nonbinary Codes Correcting Single Localized Errors
    
    Probl. Peredachi Inf., 30:2 (1994),  96–98
17. On Varshamov–Tenengolts Codes and a Conjecture of L. A. Bassalygo
    
    Probl. Peredachi Inf., 28:4 (1992),  106–108
18. Packings and coverings of the Hamming space by unit balls
    
    Dokl. Akad. Nauk SSSR, 303:3 (1988),  550–552
19. Unit Sphere Packings and Coverings of the Hamming Space
    
    Probl. Peredachi Inf., 24:4 (1988),  3–16
20. Iterative Arithmetic Independent-Error-Correcting Codes
    
    Probl. Peredachi Inf., 15:1 (1979),  38–49
21. On Bounds for Packings on a Sphere and in Space
    
    Probl. Peredachi Inf., 14:1 (1978),  3–25
22. Two generalizations of code product
    
    Dokl. Akad. Nauk SSSR, 232:6 (1977),  1277–1280
23. On Existence of Good Cyclic Almost Linear Codes over Nonprime Fields
    
    Probl. Peredachi Inf., 13:3 (1977),  18–21
24. On Bounds on the Number of Code Words in Binary Arithmetic Codes
    
    Probl. Peredachi Inf., 12:4 (1976),  46–54
25. Perfect Arithmetic Single-Error-Correcting $AN$-Codes
    
    Probl. Peredachi Inf., 12:1 (1976),  16–23
26. Arithmetic $(n,A)$ codes over an arbitrary base
    
    Dokl. Akad. Nauk SSSR, 221:4 (1975),  794–797


27. Sergey Natanzon
    
    Mosc. Math. J., 8:4 (2008),  843–844
28. Mark Semenovich Pinsker. In Memoriam
    
    Probl. Peredachi Inf., 40:1 (2004),  3–5