The following pages link to Counting sequences (Q3904546):
Displaying 13 items.
- A construction of Gray codes inducing complete graphs (Q941339) (← links)
- On the \((n,t)\)-antipodal Gray codes (Q1022591) (← links)
- Data compression and Gray-code sorting (Q1075764) (← links)
- Multidimensional interval routing schemes (Q1275073) (← links)
- Gray codes generation algorithm and theoretical evaluation of random walks in \(N\)-cubes (Q1634365) (← links)
- Antipodal Gray codes (Q1827713) (← links)
- Equipartition of mass distributions by hyperplanes (Q1911766) (← links)
- On the spectrum of Hamiltonian cycles in the \(n\)-cube (Q1984529) (← links)
- Cyclic arrangements with minimum modulo \(m\) winding numbers (Q2117515) (← links)
- Existence of a maximum balanced matching in the hypercube (Q2320869) (← links)
- Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations (Q2973273) (← links)
- Space-Optimal Quasi-Gray Codes with Logarithmic Read Complexity (Q5009569) (← links)
- Multi-dimensional Interval Routing Schemes (Q6084552) (← links)