Gashkov Igor Borisovich

Publications in Math-Net.Ru

1. The complexity of solving low degree equations over ring of integers and residue rings
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2019, no. 1,  7–15
2. Fast algorithm of square rooting in some odd characteгistic finite field
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2018, no. 5,  8–14
3. Berlekamp–Massey Algorithm, Continued Fractions, Padé Approximations, and Orthogonal Polynomials
   
   Mat. Zametki, 79:1 (2006),  45–59
4. Complexity of Boolean schemes for arithmetic in some towers of finite fields
   
   Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2006, no. 5,  10–16
5. On the complexity of the computation of differentials and gradients
   
   Diskr. Mat., 17:3 (2005),  45–67
6. Codes Associated with the Linear Fractional Group
   
   Probl. Peredachi Inf., 25:1 (1989),  3–15
7. Codes that are connected with a group of linear-fractional transformations
   
   Dokl. Akad. Nauk SSSR, 301:5 (1988),  1041–1044
8. Linear Ternary Quasi-perfect Codes Correcting Double Errors
   
   Probl. Peredachi Inf., 22:4 (1986),  43–48