Pages that link to "Item:Q3991258"
From MaRDI portal
The following pages link to On the construction of snake in the box codes (Q3991258):
Displaying 20 items.
- Sets of disjoint snakes based on a Reed-Muller code and covering the hypercube (Q1009043) (← links)
- A new lower bound for snake-in-the-box codes (Q1120544) (← 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)
- An upper bound on the size of the snake-in-the-box (Q1382411) (← links)
- Bulky subgraphs of the hypercube (Q1568786) (← links)
- On the asymptotic order of circuit codes (Q2032977) (← links)
- Isomorphism of maximum length circuit codes (Q2119935) (← links)
- Snake-in-the-box codes under the \(\ell_{\infty}\)-metric for rank modulation (Q2302152) (← links)
- The maximum length of circuit codes with long bit runs and a new characterization theorem (Q2329405) (← links)
- Snakes, coils, and single-track circuit codes with spread \(k\) (Q2352350) (← links)
- Exhaustive search for snake-in-the-box codes (Q2354613) (← links)
- A new non-asymptotic upper bound for snake-in-the-box codes (Q2768131) (← links)
- Snake-in-the-Box Codes for Rank Modulation (Q2989856) (← links)
- A lower bound for the length of snakes (Q3980377) (← links)
- (Q4261811) (← links)
- (Q4664686) (← links)
- (Q4664713) (← links)
- (Q5708597) (← links)
