Geodesic

Sommaire

Approximate computation of the weight function of a linear binary code
p. 3-19
Statistical patterns of the interaction of periods of partial words
p. 20-35
On a generalization of the minimax assignment problem
p. 36-43
On the complexity of the inversion of discrete functions of a certain class
p. 44-55
The property of metric continuation of the shortest paths in graphs
p. 56-67
On the average monotone complexity of Boolean functions
p. 68-80
Totally balanced and exponentially balanced Gray codes
p. 81-98
New books for discrete mathematics
p. 99-100