Some remarks on the combinatories of Gray codes
From MaRDI portal
Recommendations
Cited in
(17)- A note on Gray code and odd-even merge
- Explicit definition of the binary reflected Gray codes
- Counting techniques to label constant weight Gray codes with links to minimal generating sets of semigroups
- Canonical form of Gray codes in N-cubes
- Gray code enumeration of families of integer partitions
- A Gray code for permutations of size 2d with d descents
- On combinatorial Gray codes with distance 3
- scientific article; zbMATH DE number 4139306 (Why is no real title available?)
- scientific article; zbMATH DE number 3681652 (Why is no real title available?)
- scientific article; zbMATH DE number 66048 (Why is no real title available?)
- An upper bound associated with errors in Gray code (Corresp.)
- Combinatorial families that are exponentially far from being listable in Gray code sequence
- The separability of standard cyclic N-ary Gray codes
- scientific article; zbMATH DE number 4120239 (Why is no real title available?)
- Generalized Gray codes with prescribed ends
- On distance Gray codes
- scientific article; zbMATH DE number 7684688 (Why is no real title available?)
This page was built for publication: Some remarks on the combinatories of Gray codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5173759)