Gray Codes Generation Algorithm and Theoretical Evaluation of Random Walks in N-Cubes
In previous works, some of the authors have proposed a canonical form of Gray Codes (GCs) in N-cubes (hypercubes of dimension N). This form allowed them to draw an algorithm that theoretically provides exactly all the GCs for a given dimension N. In another work, we first have shown that any of thes...
Main Authors: | Sylvain Contassot-Vivier, Jean-François Couchot, Pierre-Cyrille Héam |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-06-01
|
Series: | Mathematics |
Subjects: | |
Online Access: | http://www.mdpi.com/2227-7390/6/6/98 |
Similar Items
-
Codes de Gray généralisés à l'énumération des objets d'une structure combinatoire sous contrainte
by: Castro Trejo, Aline
Published: (2012) -
Some classes of bipartite graphs induced by Gray codes
by: I Nengah Suparta
Published: (2017-10-01) -
On the existence of cycles of every even length on generalized Fibonacci cubes
by: Norma Zagaglia Salvi
Published: (1996-12-01) -
Switching Systems Synthesis Method Using Permuted Gray Code Tables (PGC Method)
by: Cesar Troya-Sherdek, et al.
Published: (2021-01-01) -
Shannon Entropy Loss in Mixed-Radix Conversions
by: Amy Vennos, et al.
Published: (2021-07-01)