Alexander Mikhailovich Romanov

Sorry, we do not have enough data to show an influence graph for this author.
Learn More
A 1-perfect code C n q is called Hamiltonian if its minimum distance graph G(C n q) contains a Hamiltonian cycle. In this paper, for all admissible lengths n ≥ 13, we construct Hamiltonian nonlinear ternary 1-perfect codes, and for all admissible lengths n ≥ 21, we construct Hamiltonian nonlinear quaternary 1-perfect codes. The existence of Hamiltonian(More)
  • 1