I. Gashkov

发表

Berlekamp—Massey Algorithm, Continued Fractions, Pade Approximations, and Orthogonal Polynomials

S. Gashkov, I. Gashkov, 2006 .

On the complexity of calculation of differentials and gradients

S. B. Gashkov, S. Gashkov, I. Gashkov, 2005 .

О сложности вычисления дифференциалов и градиентов@@@On the complexity of the computation of differentials and gradients

С.Б. Гашков, S. B. Gashkov, I. Gashkov, 2005 .

The Complexity of Solving Low Degree Equations over Ring of Integers and Residue Rings

S. B. Gashkov, I. Gashkov, A. Frolov, 2019, Moscow University Mathematics Bulletin.

Some Remarks on Testing Irreducibility of Polynomials and Normality of Bases in Finite Fields

Sergej B. Gashkov, Igor Gashkov, S. B. Gashkov, 2010, Fundam. Informaticae.

Bit parallel circuits for arithmetic operations in composite fields $ GF(2^{nm}) (CMMSE)

A. A. Burtsev, Igor Gachkov, I. Gashkov, 2010 .

Error Correcting Codes with Mathematica

Igor Gashkov, I. Gashkov, 2003, International Conference on Conceptual Structures.

Using the package Coding Theory for a search technique for Quasi-perfect Codes

Igor Gashkov, I. Gashkov, 2008 .

Constant Weight Codes with Package CodingTheory.m in Mathematica

Igor Gashkov, I. Gashkov, 2004, International Conference on Computational Science.

Codes, Connected With a Fraction Linear Functions Group and Their Decoding

V. M. Sidelnikov, Igor Gashkov, V. Sidelnikov, 1987, International Symposium on Fundamentals of Computation Theory.

The Berlekamp-Massey Algorithm. A Sight from Theory of Pade Approximants and Orthogonal Polynomials

Sergej B. Gashkov, Igor Gashkov, S. B. Gashkov, 2004, International Conference on Computational Science.

The Complexity of Solving Low Degree Equations over Ring of Integers and Residue Rings

S. B. Gashkov, I. Gashkov, A. Frolov, 2019, Moscow University Mathematics Bulletin.