Article ID Journal Published Year Pages File Type
418695 Discrete Applied Mathematics 2014 8 Pages PDF
Abstract

The coil-in-the-box problem asks for a simple chordless cycle of maximum length in the nn-cube. Such cycles are also known as nn-dimensional spread 2 circuit codes, or nn-coils. This problem has been solved earlier for n≤7n≤7. An approach based on canonical augmentation is here used to solve the problem for n=8n=8 and show that the maximum length of a chordless cycle in the 8-cube is 96. Several new 8-coils of length 96 are presented.

Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, ,