Pages that link to "Item:Q1408531"
From MaRDI portal
The following pages link to Binary Gray codes with long bit runs (Q1408531):
Displaying 17 items.
- Generalized Gray codes with prescribed ends (Q512653) (← links)
- Description of polygonal regions by polynomials of bounded degree (Q621777) (← links)
- A construction of Gray codes inducing complete graphs (Q941339) (← links)
- Linear time construction of a compressed Gray code (Q1761499) (← links)
- Antipodal Gray codes (Q1827713) (← links)
- On the spectrum of Hamiltonian cycles in the \(n\)-cube (Q1984529) (← links)
- Gray codes and symmetric chains (Q2072179) (← links)
- The maximum length of circuit codes with long bit runs and a new characterization theorem (Q2329405) (← links)
- Local search and high precision Gray codes: Convergence results and neighborhoods (Q2776421) (← links)
- On locally balanced gray codes (Q3186855) (← links)
- (Q3816026) (← links)
- 2-Factors Without Close Edges in the n-Dimensional Cube (Q4973257) (← links)
- (Q5002744) (← links)
- Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity (Q5009569) (← links)
- On distance Gray codes (Q5373994) (← links)
- Foundations of Genetic Algorithms (Q5703889) (← links)
- On flips in planar matchings (Q5919054) (← links)