A new upper bound for the length of snakes (Q1061716)

A d-dimensional circuit code of spread s is a simple circuit C in the graph of the d-dimensional unit cube with the property that for any vertices x and y of C which differ in exactly r coordinates, \(r<s\), there exists a path from x to y consisting of r edges of C. This property is useful for detecting and limiting errors. In this paper we give a new upper bound for the maximum length of a d-dimensional circuit code of spread 2.