Improved Methods For Generating Quasi-Gray Codes

Details Improved Methods For Generating Quasi-Gray Codes Improved Methods For Generating Quasi-Gray Codes

2010-10-05

arxiv.org/abs/1010.0905v1

Computer Science

Discrete Mathematics

Masters Thesis. A conference version appeared in the proceedings of SWAT 2010

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Improved Methods For Generating Quasi-Gray Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improved Methods For Generating Quasi-Gray Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Methods For Generating Quasi-Gray Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-87046