Romanov Alexander Mikhailovich

Publications in Math-Net.Ru

1. On the rank of nonlinear quasi-perfect codes over a finite field
   
   Probl. Peredachi Inf., 60:3 (2024),  3–12
2. On perfect and Reed–Muller codes over finite fields
   
   Probl. Peredachi Inf., 57:3 (2021),  3–16
3. On the embedding of constant-weight codes into perfect codes
   
   Diskretn. Anal. Issled. Oper., 23:4 (2016),  26–34
4. On full-rank perfect codes over finite fields
   
   Diskretn. Anal. Issled. Oper., 23:3 (2016),  107–123
5. On the admissible families of components of Hamming codes
   
   Diskretn. Anal. Issled. Oper., 19:2 (2012),  84–91
6. On combinatorial Gray codes with distance 3
   
   Diskr. Mat., 21:3 (2009),  73–78
7. A survey of methods for constructing nonlinear perfect binary codes
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 13:4 (2006),  60–88
8. On partitions of $q$-ary Hamming codes into disjoint components
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 11:3 (2004),  80–87
9. On partitions of Hamming codes into disjoint components
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 9:1 (2002),  42–48
10. Perfect binary codes with a trivial kernel
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 7:2 (2000),  71–74
11. On nonsystematic perfect codes of length 15
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 4:4 (1997),  75–78
12. On the construction of perfect nonlinear binary codes by symbol inversion
    
    Diskretn. Anal. Issled. Oper., Ser. 1, 4:1 (1997),  46–52
13. New Binary Codes with Minimum Distance 3
    
    Probl. Peredachi Inf., 19:3 (1983),  101–102