1. Preface

   • I. A. Faradžev
   • A. A. Ivanov
   • M. H. Klin

   EditorialNotes Pages: v - v

2. Designs as maximum codes in polynomial metric spaces

   • V. I. Levenshtein

   OriginalPaper Pages: 1 - 82

3. The k-orbit reconstruction and the orbit algebra

   • V. B. Mnukhin

   OriginalPaper Pages: 83 - 117

4. Subschemes of Hamming association schemes H(n, q), q≥4

   • M. E. Muzychuk

   OriginalPaper Pages: 119 - 128

5. Skew-symmetric association schemes with two classes and strongly regular graphs of type L _2n−1(4n−1)

   • Dmitrii V. Pasechnik

   OriginalPaper Pages: 129 - 138

6. Polynomial time algorithms for recognizing and isomorphism testing of cyclic tournaments

   • I. N. Ponomarenko

   OriginalPaper Pages: 139 - 160

7. On the action of a group on a graph

   • V. I. Trofimov

   OriginalPaper Pages: 161 - 170