Geodesic

Sommaire

On the structure of minimal distance graphs of perfect binary (n,3)-codes
p. 3-5
The height of small faces in planar normal maps
p. 6-17
Edge and total coloring of interval graphs
p. 18-24
On the distance between perfect binary codes
p. 25-29
On problems of lexicographic optimization
p. 30-37
Distance-preserving cyclic codes on a linear basis
p. 38-44
An estimate for the accuracy of the greedy descent algorithm for the problem of minimizing a~supermodular function
p. 45-60
On cyclic ⟨m,n⟩-numerations
p. 61-70
On the algorithmic complexity of the classical reliability problem
p. 71-80
Fast coding of Markov sources with low entropy
p. 81-96
New books for discrete mathematics
p. 97-99