Improved Methods For Generating Quasi-Gray Codes
Discrete Mathematics
2010-10-06 v1
Abstract
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.
Cite
@article{arxiv.1010.0905,
title = {Improved Methods For Generating Quasi-Gray Codes},
author = {Dana Jansens and Prosenjit Bose and Paz Carmi and Anil Maheshwari and Pat Morin and Michiel Smid},
journal= {arXiv preprint arXiv:1010.0905},
year = {2010}
}
Comments
Masters Thesis. A conference version appeared in the proceedings of SWAT 2010