On Generating the N-ary Reflected Gray Codes
From MaRDI portal
Recommendations
Cited in
(27)- On m-ary Gray codes
- A technique for generating Gray codes
- \(q\)-ary Gray codes and weight distributions
- Explicit definition of the binary reflected Gray codes
- A 2D non-overlapping code over a q-ary alphabet
- Gray codes for reflection groups
- A loopless algorithm for generating the permutations of a multiset
- Restricted compositions and permutations: from old to new Gray codes
- Gray cycles of maximum length related to \(k\)-character substitutions
- On binary reflected Gray codes and functions
- A note on iterating an -ary Gray code
- Gray codes and overlap cycles for restricted weight words
- Iterating an \alpha-ary Gray code
- scientific article; zbMATH DE number 1933234 (Why is no real title available?)
- scientific article; zbMATH DE number 2077662 (Why is no real title available?)
- A trace partitioned Gray code forq-ary generalized Fibonacci strings
- Cross-bifix-free sets in two dimensions
- Affine m-ary gray codes
- scientific article; zbMATH DE number 3409221 (Why is no real title available?)
- A fractal set from the binary reflected Gray code
- Loopless algorithms to generate maximum length Gray cycles wrt. \(k\)-character substitutions
- scientific article; zbMATH DE number 7684688 (Why is no real title available?)
- Two instances of random access code in the quantum regime
- Multi-dimensional unlimited sampling and robust reconstruction
- Gray code orders for \(q\)-ary words avoiding a given factor
- Improved approximation algorithm for convex recoloring of trees
- Gray codes for reflectable languages
This page was built for publication: On Generating the N-ary Reflected Gray Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3331130)
