Improved methods for generating quasi-gray codes

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

doi:10.1007/978-3-642-13731-0_22

Improved methods for generating quasi-gray codes

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

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

7 Scopus citations

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.

Original language	English
Title of host publication	Algorithm Theory - SWAT 2010 - 12th Scandinavian Symposium and Workshops on Algorithm Theory, Proceedings
Pages	224-235
Number of pages	12
DOIs	https://doi.org/10.1007/978-3-642-13731-0_22
State	Published - 21 Jul 2010
Event	12th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2010 - Bergen, Norway Duration: 21 Jun 2010 → 23 Jun 2010

Publication series

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

Conference

Conference	12th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2010
Country/Territory	Norway
City	Bergen
Period	21/06/10 → 23/06/10

Keywords

Gray codes
combinatorial generation
counting
decision trees
quasi-Gray codes

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-642-13731-0_22

Cite this

Bose, P., Carmi, P., Jansens, D., Maheshwari, A., Morin, P., & Smid, M. (2010). Improved methods for generating quasi-gray codes. In Algorithm Theory - SWAT 2010 - 12th Scandinavian Symposium and Workshops on Algorithm Theory, Proceedings (pp. 224-235). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6139 LNCS). https://doi.org/10.1007/978-3-642-13731-0_22

@inproceedings{589fddc20e9347bb83ab62bcf233adcb,

title = "Improved methods for generating quasi-gray codes",

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.",

keywords = "Gray codes, combinatorial generation, counting, decision trees, quasi-Gray codes",

author = "Prosenjit Bose and Paz Carmi and Dana Jansens and Anil Maheshwari and Pat Morin and Michiel Smid",

year = "2010",

month = jul,

day = "21",

doi = "10.1007/978-3-642-13731-0_22",

language = "English",

isbn = "364213730X",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "224--235",

booktitle = "Algorithm Theory - SWAT 2010 - 12th Scandinavian Symposium and Workshops on Algorithm Theory, Proceedings",

note = "12th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2010 ; Conference date: 21-06-2010 Through 23-06-2010",

}

Bose, P, Carmi, P, Jansens, D, Maheshwari, A, Morin, P & Smid, M 2010, Improved methods for generating quasi-gray codes. in Algorithm Theory - SWAT 2010 - 12th Scandinavian Symposium and Workshops on Algorithm Theory, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6139 LNCS, pp. 224-235, 12th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2010, Bergen, Norway, 21/06/10. https://doi.org/10.1007/978-3-642-13731-0_22

Improved methods for generating quasi-gray codes. / Bose, Prosenjit; Carmi, Paz; Jansens, Dana et al.
Algorithm Theory - SWAT 2010 - 12th Scandinavian Symposium and Workshops on Algorithm Theory, Proceedings. 2010. p. 224-235 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6139 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Improved methods for generating quasi-gray codes

AU - Bose, Prosenjit

AU - Carmi, Paz

AU - Jansens, Dana

AU - Maheshwari, Anil

AU - Morin, Pat

AU - Smid, Michiel

PY - 2010/7/21

Y1 - 2010/7/21

N2 - 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.

AB - 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.

KW - Gray codes

KW - combinatorial generation

KW - counting

KW - decision trees

KW - quasi-Gray codes

UR - http://www.scopus.com/inward/record.url?scp=77954627805&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-13731-0_22

DO - 10.1007/978-3-642-13731-0_22

M3 - Conference contribution

AN - SCOPUS:77954627805

SN - 364213730X

SN - 9783642137303

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 224

EP - 235

BT - Algorithm Theory - SWAT 2010 - 12th Scandinavian Symposium and Workshops on Algorithm Theory, Proceedings

T2 - 12th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2010

Y2 - 21 June 2010 through 23 June 2010

ER -

Bose P, Carmi P, Jansens D, Maheshwari A, Morin P, Smid M. Improved methods for generating quasi-gray codes. In Algorithm Theory - SWAT 2010 - 12th Scandinavian Symposium and Workshops on Algorithm Theory, Proceedings. 2010. p. 224-235. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-13731-0_22

Improved methods for generating quasi-gray codes

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this