Improved methods for generating quasi-gray codes

Prosenjit Bose, Paz Carmi, Dana Jansens, Anil Maheshwari, Pat Morin, Michiel Smid

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations


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.

Original languageEnglish
Title of host publicationAlgorithm Theory - SWAT 2010 - 12th Scandinavian Symposium and Workshops on Algorithm Theory, Proceedings
Number of pages12
StatePublished - 21 Jul 2010
Event12th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2010 - Bergen, Norway
Duration: 21 Jun 201023 Jun 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6139 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference12th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2010


  • Gray codes
  • combinatorial generation
  • counting
  • decision trees
  • quasi-Gray codes

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'Improved methods for generating quasi-gray codes'. Together they form a unique fingerprint.

Cite this