RUS
ENG
Full version
JOURNALS
// Prikladnaya Diskretnaya Matematika
// Archive
2019, Number 46
Theoretical Backgrounds of Applied Discrete Mathematics
Some methods for constructing MDS-matrices over finite field
O. Coy Puente, R. A. De La Cruz Jiménez
5
$2$
-Transitivity degree for one class of substitutions over finite fields
D. H. Hernández Piloto
19
Mathematical Methods of Cryptography
Cryptanalytical finite automaton invertibility with finite delay
G. P. Agibalov
27
Mathematical Backgrounds of Computer and Control System Reliability
A method for constructing logic networks allowing short single diagnostic tests
K. A. Popkov
38
Mathematical Backgrounds of Informatics and Programming
Associative parallel algorithm for dynamic update of shortest paths tree after inserting an arc
A. Sh. Nepomniaschaya, T. V. Snytnikova
58
On generic complexity of the graph clustering problem
A. N. Rybalov
72
Computational Methods in Discrete Mathematics
Algorithms for computing cryptographic characteristics of vectorial Boolean functions
N. M. Kiseleva, E. S. Lipatova, I. A. Pankratova, E. E. Trifonova
78
Computation of a determinant and a matrix product in cellular automata
V. S. Kozhevnikov, I. V. Matyushkin
88
Mutually-recursive formulas for enumerating partitions of the rectangle
A. M. Magomedov, T. A. Magomedov, S. A. Lawrencenko
108
Letter to the editors
A. Yu. Zubov
122
©
Steklov Math. Inst. of RAS
, 2026