Geodesic

Sommaire du Fascicule no. 1

An algorithm for finding the minimum degree of~a~polynomial over~a~finite field for~a~function over~a~vector space depending on~the~choice of~an~irreducible polynomial
p. 5-15
Bernoulli's discrete periodic functions
p. 16-36
Characterizations of non associative ordered semigroups by the properties of their fuzzy ideals with thresholds $(\alpha,\beta]$
p. 37-59
Authentication encryption based on authentication code with secrecy
p. 60-69
On the arbitrarily reliable implementation of~Boolean~functions by non-branching programs with~a conditional stop operator in~bases~with~generalized conjunction
p. 70-77
Synthesis of easily testable logic networks under~arbitrary stuck-at faults at~inputs~and~outputs~of~gates
p. 78-100
On properties of primitive sets of digraphs with common cycles
p. 101-114
On improved universal estimation of exponents of~digraphs
p. 115-123

Sommaire du Fascicule no. 2

Properties of components for some classes of~vectorial~Boolean functions
p. 5-11
Donaghey's transformation: carousel effects and~tame~components
p. 12-33
Cryptanalytic concept of~finite~automaton invertibility with finite delay
p. 34-42
Analysis of the methods for~attribute-based~access~control
p. 43-57
About reliability of circuits in the basis consisting of~the Webb function in $P_k$ under failures of 0 type and~$k-1$~type at the outputs of elements
p. 58-66
On application of algebraic geometry codes of~$L$-construction in copy protection
p. 67-93
On list decoding of wavelet codes over finite fields of~characteristic two
p. 94-106
On generic undecidability of Hilbert's tenth problem for polynomial trees
p. 107-112
Decompositional approach to research of~formal~contexts
p. 113-126

Sommaire du Fascicule no. 3

In memory of Valentina Vladimirovna Bykova
Decidability of the restricted theories of a class of~partial orders
p. 6-12
On the degree of restrictions of $q$-valued logic functions to linear manifolds
p. 13-25
On binary solutions to systems of equations
p. 26-32
On the construction of a semantically secure modification of the McEliece cryptosystem
p. 33-43
Sufficient conditions for implementation of Boolean functions by asymptotically optimal on reliability circuits with the trivial estimate of unreliability in the case of faults of type $0$ at the element outputs
p. 44-54
Comparison of sufficient degree based conditions for Hamiltonian graph
p. 55-63
Approximate algorithms for~graph~clustering~problem
p. 64-77
On the one edge algorithm for the orthogonal double covers
p. 78-84
On complexity of the existential and universal theories of finite fields
p. 85-89
Minimization of context-free grammars
p. 90-96
Informational capacity of the Hopfield network with~quantized weights
p. 97-103
The traveling salesman problem: approximate algorithm by branch-and-bound method with~guaranteed precision
p. 104-112
Non-contradictory aggregation of quasi-order relations
p. 113-126

Sommaire du Fascicule no. 4

Some methods for constructing MDS-matrices over~finite field
p. 5-18
$2$-Transitivity degree for one class of~substitutions over finite fields
p. 19-26
Cryptanalytical finite~automaton invertibility with finite delay
p. 27-37
A method for constructing logic networks allowing~short single diagnostic tests
p. 38-57
Associative parallel algorithm for dynamic update of~shortest paths tree after inserting an arc
p. 58-71
On generic complexity of~the~graph clustering problem
p. 72-77
Algorithms for computing cryptographic characteristics of vectorial Boolean functions
p. 78-87
Computation of a determinant and a matrix product in~cellular automata
p. 88-107
Mutually-recursive formulas for enumerating partitions of the rectangle
p. 108-121
Letter to the editors