\input zb-basic
\input zb-ioport
\iteman{io-port 05724323}
\itemau{Bose, Prosenjit; Carmi, Paz; Jansens, Dana; Maheshwari, Anil; Morin, Pat; Smid, Michiel}
\itemti{Improved methods for generating quasi-Gray codes.}
\itemso{Kaplan, Haim (ed.), Algorithm theory -- SWAT 2010. 12th Scandinavian symposium and workshops on algorithm theory, Bergen, Norway, June 21--23, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13730-3/pbk). Lecture Notes in Computer Science 6139, 224-235 (2010).}
\itemab
Summary: Consider a sequence of bit strings of length $d$, such that each string differs from the next in a constant number of bits. We call this sequence a quasi-Gray code. We examine the problem of efficiently generating such codes, by considering the number of bits read and written at each generating step, the average number of bits read while generating the entire code, and the number of strings generated in the code. Our results give a trade-off between these constraints, and present algorithms that do less work on average than previous results, and that increase the number of bit strings generated.
\itemrv{~}
\itemcc{}
\itemut{Gray codes; quasi-Gray codes; decision trees; counting; combinatorial generation}
\itemli{doi:10.1007/978-3-642-13731-0\_22}
\end