A new upper bound for the length of snakes (Q1061716): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lengths of snakes in boxes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Upper bounds on the length of circuits of even spread in the d-cube / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5607113 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Generalized Snake-in-the-Box Codes / rank | |||
Normal rank | |||
Latest revision as of 17:25, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new upper bound for the length of snakes |
scientific article |
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
