Avgustinovich Sergey Vladimirovich

Publications in Math-Net.Ru

1. Small length circuits in Eulerian orientations of graphs
   
   Sib. Èlektron. Mat. Izv., 21:1 (2024),  370–382
2. The perfect colorings of circulant graphs with a large number of colors
   
   Sib. Èlektron. Mat. Izv., 21:1 (2024),  188–195
3. Test fragments of perfect colorings of circulant graphs
   
   Sib. Èlektron. Mat. Izv., 20:2 (2023),  638–645
4. On perfect colorings of paths divisible by a matching
   
   Diskretn. Anal. Issled. Oper., 29:1 (2022),  33–45
5. Completely regular codes in the $n$-dimensional rectangular grid
   
   Sib. Èlektron. Mat. Izv., 19:2 (2022),  861–869
6. On perfect colorings of infinite multipath graphs
   
   Sib. Èlektron. Mat. Izv., 17 (2020),  2084–2095
7. Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs
   
   Sibirsk. Mat. Zh., 61:5 (2020),  1087–1100
8. Maximum intersection of linear codes and codes equivalent to linear
   
   Diskretn. Anal. Issled. Oper., 26:4 (2019),  5–15
9. On automorphisms of linear codes over a prime field
   
   Sib. Èlektron. Mat. Izv., 14 (2017),  210–217
10. Multiplicities of eigenvalues of the Star graph
    
    Sib. Èlektron. Mat. Izv., 13 (2016),  1258–1270
11. Perfect colorings of the prism graph
    
    Sib. Èlektron. Mat. Izv., 13 (2016),  1116–1128
12. Completely regular codes in the infinite hexagonal grid
    
    Sib. Èlektron. Mat. Izv., 13 (2016),  987–1016
13. On vectors of minimal support in transitive linear spaces
    
    Sib. Èlektron. Mat. Izv., 12 (2015),  960–966
14. On antipodal properties for eigenfunctions of graphs
    
    Sib. Èlektron. Mat. Izv., 12 (2015),  862–867
15. On reconstruction of a binary code from dimensions of its subcodes
    
    Diskretn. Anal. Issled. Oper., 19:6 (2012),  3–8
16. The computation complexity in the class of formulas
    
    Diskretn. Anal. Issled. Oper., 19:3 (2012),  3–12
17. Distance regular colorings of the infinite rectangular grid
    
    Diskretn. Anal. Issled. Oper., 18:3 (2011),  3–10
18. Perfect 2-colorings of transitive cubic graphs
    
    Diskretn. Anal. Issled. Oper., 18:2 (2011),  3–17
19. Induced perfect colorings
    
    Sib. Èlektron. Mat. Izv., 8 (2011),  310–316
20. On reconstruction of binary codes by dimensions of their subcodes
    
    Diskretn. Anal. Issled. Oper., 17:5 (2010),  15–21
21. Perfect 2-colorings of Johnson graphs $J(8,3)$ and $J(8,4)$
    
    Diskretn. Anal. Issled. Oper., 17:2 (2010),  3–19
22. Multidimensional permanents in enumrative problems
    
    Diskretn. Anal. Issled. Oper., 15:5 (2008),  3–5
23. On mobile sets in the binary hypercube
    
    Diskretn. Anal. Issled. Oper., 15:3 (2008),  11–21
24. Reconstruction theorems for centered functions and perfect codes
    
    Sibirsk. Mat. Zh., 49:3 (2008),  483–489
25. Partitions of an $n$-Cube into Nonequivalent Perfect Codes
    
    Probl. Peredachi Inf., 43:4 (2007),  45–50
26. On the Structure of Symmetry Groups of Vasil'ev Codes
    
    Probl. Peredachi Inf., 41:2 (2005),  42–49
27. Computation of a centered function from its values on the middle layers of the Boolean cube
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 10:2 (2003),  3–16
28. On the Rank and Kernel Problem for Perfect Codes
    
    Probl. Peredachi Inf., 39:4 (2003),  30–34
29. To Metric Rigidity of Binary Codes
    
    Probl. Peredachi Inf., 39:2 (2003),  23–28
30. Perfect codes of complete rank with kernels of large dimensions
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 8:4 (2001),  3–8
31. Distributive colorings of plane triangulations of minimum degree five
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 8:1 (2001),  3–16
32. On the strong isometry of binary codes
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 7:3 (2000),  3–5
33. On the structure of minimal distance graphs of perfect binary $(n,3)$-codes
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 5:4 (1998),  3–5
34. On Distance Regularity of Perfect Binary Codes
    
    Probl. Peredachi Inf., 34:3 (1998),  47–49
35. On the partition of a set of edges of a graph into isomorphic trees
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 4:4 (1997),  3–5
36. Construction of Perfect Binary Codes by Sequential Shifts of $\tilde\alpha$-Components
    
    Probl. Peredachi Inf., 33:3 (1997),  15–21
37. On the Nonsystematic Perfect Binary Codes
    
    Probl. Peredachi Inf., 32:3 (1996),  47–50
38. Neighborhoods of edges in normal cards
    
    Diskretn. Anal. Issled. Oper., 2:3 (1995),  3–9
39. On a property of perfect binary codes
    
    Diskretn. Anal. Issled. Oper., 2:1 (1995),  4–6
40. The number of different subwords of given length in the Morse–Hedlund sequence
    
    Sibirsk. Zh. Issled. Oper., 1:2 (1994),  3–7
41. On the isometricity of densely packed binary codes
    
    Trudy Inst. Mat. SO RAN, 27 (1994),  3–5


42. In memory of Dmitry Germanovich Fon-Der-Flaass
    
    Sib. Èlektron. Mat. Izv., 7 (2010),  1–4