A new upper bound for the length of snakes (Q1061716)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new upper bound for the length of snakes |
scientific article; zbMATH DE number 3910300
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new upper bound for the length of snakes |
scientific article; zbMATH DE number 3910300 |
Statements
A new upper bound for the length of snakes (English)
0 references
1985
0 references
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.
0 references
circuit code
0 references
graph of the d-dimensional unit cube
0 references
maximum length
0 references
0.9015693
0 references
0.88827723
0 references
0.8741149
0 references
0.8659944
0 references
0 references
