|
This article is cited in 2 scientific papers (total in 2 papers)
On combinatorial Gray codes with distance 3
A. M. Romanov
Abstract:
We suggest a construction of the cyclic binary combinatorial Gray codes with distance 3 and dimension $n=2^k-1$, where $k=3,4,\dots$. We give a method of construction of Hamiltonian cycles in the graphs of minimum distances of binary Hamming codes. For all admissible lengths $n\ge15$, we give nonlinear perfect binary codes whose graphs of minimum distances contain a Hamiltonian cycle.
Received: 05.05.2008 Revised: 05.05.2009
Citation:
A. M. Romanov, “On combinatorial Gray codes with distance 3”, Diskr. Mat., 21:3 (2009), 73–78; Discrete Math. Appl., 19:4 (2009), 383–388
Linking options:
https://www.mathnet.ru/eng/dm1062https://doi.org/10.4213/dm1062 https://www.mathnet.ru/eng/dm/v21/i3/p73
|
Statistics & downloads: |
Abstract page: | 599 | Full-text PDF : | 248 | References: | 58 | First page: | 24 |
|