-Details on the construction of hamiltonian paths in the
-$\mathsf{N}$-cube may be found in~\cite[Section 4]{DBLP:conf/secrypt/CouchotHGWB14}.
\ No newline at end of file
+This section ends with the idea of removing a Hamiltonian cycle in the
+$\mathsf{N}$-cube.
+In such a context, the Hamiltonian cycle is equivalent to a Gray code.
+Many approaches have been proposed a way to build such codes, for instance
+the Reflected Binary Code. In this one, one of the bits is switched
+exactly $2^{\mathsf{N}-}$ for a $\mathsf{N}$-length cycle.
+
+%%%%%%%%%%%%%%%%%%%%%
+
+The function that is built
+from the
+
+The next section presents how to build balanced Hamiltonian cycles in the
+$\mathsf{N}$-cube with the objective to embed them into the
+pseudorandom number generator.
+
+%%% Local Variables:
+%%% mode: latex
+%%% TeX-master: "main"
+%%% ispell-dictionary: "american"
+%%% mode: flyspell
+%%% End: