Improved methods for generating quasi-gray codes
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.
|combinatorial generation, counting, decision trees, Gray codes, quasi-Gray codes|
Bose, P, Carmi, P. (Paz), Jansens, D. (Dana), Maheshwari, A, Morin, P, & Smid, M. (2010). Improved methods for generating quasi-gray codes. doi:10.1007/978-3-642-13731-0_22