Pages that link to "Item:Q3331130"
From MaRDI portal
The following pages link to On Generating the N-ary Reflected Gray Codes (Q3331130):
Displaying 15 items.
- Prefix partitioned Gray codes for particular cross-bifix-free sets (Q458743) (← links)
- Cross-bifix-free sets in two dimensions (Q517032) (← links)
- Gray code orders for \(q\)-ary words avoiding a given factor (Q748433) (← links)
- Improved approximation algorithm for convex recoloring of trees (Q927405) (← links)
- \(q\)-ary Gray codes and weight distributions (Q1294219) (← links)
- A 2D non-overlapping code over a \(q\)-ary alphabet (Q1704207) (← links)
- Gray codes for reflection groups (Q1825283) (← links)
- A loopless algorithm for generating the permutations of a multiset (Q1885026) (← links)
- Restricted compositions and permutations: from old to new Gray codes (Q1944104) (← links)
- Gray cycles of maximum length related to \(k\)-character substitutions (Q2096591) (← links)
- Gray codes and overlap cycles for restricted weight words (Q2931928) (← links)
- A trace partitioned Gray code for<i>q</i>-ary generalized Fibonacci strings (Q5069743) (← links)
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions (Q6052708) (← links)
- (Q6157408) (← links)
- Two instances of random access code in the quantum regime (Q6556543) (← links)