\begin{thebibliography}{}

\bibitem[Bahi et~al., 2011]{BCGR11}
Bahi, J., Couchot, J.-F., Guyeux, C., and Richard, A. (2011).
\newblock On the link between strongly connected iteration graphs and chaotic
  boolean discrete-time dynamical systems.
\newblock In Owe, O., Steffen, M., and Telle, J., editors, {\em Fundamentals of
  Computation Theory}, volume 6914 of {\em Lecture Notes in Computer Science},
  pages 126--137. Springer Berlin Heidelberg.

\bibitem[Barker and Roginsky, 2010]{Nist10}
Barker, E. and Roginsky, A. (2010).
\newblock Draft {N}{I}{S}{T} special publication 800-131 recommendation for the
  transitioning of cryptographic algorithms and key sizes.

\bibitem[Bhat and Savage, 1996]{journals/combinatorics/BhatS96}
Bhat, G.~S. and Savage, C.~D. (1996).
\newblock Balanced gray codes.
\newblock {\em Electr. J. Comb.}, 3(1).

\bibitem[Feder and Subi, 2009]{Feder:2009:NTB:1496397.1496515}
Feder, T. and Subi, C. (2009).
\newblock Nearly tight bounds on the number of hamiltonian circuits of the
  hypercube and generalizations.
\newblock {\em Inf. Process. Lett.}, 109(5):267--272.

\bibitem[Flahive and Bose, 2007]{journals/combinatorics/FlahiveB07}
Flahive, M. and Bose, B. (2007).
\newblock Balancing cyclic r-ary gray codes.
\newblock {\em Electr. J. Comb.}, 14(1).

\bibitem[Marsaglia, 1996]{Marsaglia1996}
Marsaglia, G. (1996).
\newblock Die{HARD}: a battery of tests of randomness.
\newblock {\em http://stat.fsu.edu/~geo/diehard.html}.

\bibitem[Zanten and Suparta, 2004]{VanSup04}
Zanten, A.~J.~v. and Suparta, I.~N. (2004).
\newblock Totally balanced and exponentially balanced gray codes.
\newblock {\em Discrete Analysis and Operational Research}, 11:81--98.

\end{thebibliography}