Abstract
We suggest a construction of the cyclic binary combinatorial Gray codes with distance 3 and dimension n = 2k – 1, where k = 3, 4, . . . We give a method of construction of Hamiltonian cycles in the graphs of minimum distances of binary Hamming codes. For all admissible lengths n ≥ 15, we give nonlinear perfect binary codes whose graphs of minimum distances contain a Hamiltonian cycle.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
