Pages that link to "Item:Q1120544"
From MaRDI portal
The following pages link to A new lower bound for snake-in-the-box codes (Q1120544):
Displaying 17 items.
- On the maximum length of coil-in-the-box codes in dimension 8 (Q477349) (← links)
- On the snake-in-the-box codes for rank modulation under Kendall's \(\tau \)-metric (Q522220) (← links)
- Hypercube sandwich approach to conferencing. (Q676254) (← links)
- Further results on snakes in powers of complete graphs (Q1182573) (← links)
- The snake-in-the-box problem: A new upper bound (Q1336714) (← links)
- Covering the hypercube with a bounded number of disjoint snakes (Q1343173) (← links)
- On constructing snakes in powers of complete graphs (Q1381860) (← links)
- Maximal facet-to-facet snakes of unit cubes (Q1591757) (← links)
- Isomorphism of maximum length circuit codes (Q2119935) (← links)
- Snakes, coils, and single-track circuit codes with spread \(k\) (Q2352350) (← links)
- A new non-asymptotic upper bound for snake-in-the-box codes (Q2768131) (← links)
- (Q3457251) (← links)
- A lower bound for the length of snakes (Q3980377) (← links)
- On the construction of snake in the box codes (Q3991258) (← links)
- (Q4664686) (← links)
- (Q4664713) (← links)
- (Q5708597) (← links)
