Efficient Generation of the Binary Reflected Gray Code and Its Applications

James R. Bitner; Gideon Ehrlich; Edward M. Reingold

doi:10.1145/360336.360343

Efficient Generation of the Binary Reflected Gray Code and Its Applications

James R. Bitner
, Gideon Ehrlich
, Edward M. Reingold

Department of Computer Science and Artificial Intelligence

University of Illinois at Urbana-Champaign

Research output: Contribution to journal › Article › peer-review

228 Scopus citations

Abstract

Algorithms are presented to generate the n-bit binary reflected Gray code and codewords of fixed weight in that code. Both algorithms are efficient in that the time required to generate the next element from the current one is constant. Applications to the generation of the combinations of n things taken k at a time, the compositions of integers, and the permutations of a multiset are discussed.

Original language	English
Pages (from-to)	517-521
Number of pages	5
Journal	Communications of the ACM
Volume	19
Issue number	9
DOIs	https://doi.org/10.1145/360336.360343
State	Published - 1 Sep 1976

Keywords

Gray code
combinations
combinatorial computing
compositions
subsets

Access to Document

10.1145/360336.360343

Cite this

@article{1d4cfcdf42634edd8974af900c8ae396,

title = "Efficient Generation of the Binary Reflected Gray Code and Its Applications",

abstract = "Algorithms are presented to generate the n-bit binary reflected Gray code and codewords of fixed weight in that code. Both algorithms are efficient in that the time required to generate the next element from the current one is constant. Applications to the generation of the combinations of n things taken k at a time, the compositions of integers, and the permutations of a multiset are discussed.",

keywords = "Gray code, combinations, combinatorial computing, compositions, subsets",

author = "Bitner, \{James R.\} and Gideon Ehrlich and Reingold, \{Edward M.\}",

year = "1976",

month = sep,

day = "1",

doi = "10.1145/360336.360343",

language = "אנגלית",

volume = "19",

pages = "517--521",

journal = "Communications of the ACM",

issn = "0001-0782",

publisher = "Association for Computing Machinery (ACM)",

number = "9",

}

TY - JOUR

T1 - Efficient Generation of the Binary Reflected Gray Code and Its Applications

AU - Bitner, James R.

AU - Ehrlich, Gideon

AU - Reingold, Edward M.

PY - 1976/9/1

Y1 - 1976/9/1

N2 - Algorithms are presented to generate the n-bit binary reflected Gray code and codewords of fixed weight in that code. Both algorithms are efficient in that the time required to generate the next element from the current one is constant. Applications to the generation of the combinations of n things taken k at a time, the compositions of integers, and the permutations of a multiset are discussed.

AB - Algorithms are presented to generate the n-bit binary reflected Gray code and codewords of fixed weight in that code. Both algorithms are efficient in that the time required to generate the next element from the current one is constant. Applications to the generation of the combinations of n things taken k at a time, the compositions of integers, and the permutations of a multiset are discussed.

KW - Gray code

KW - combinations

KW - combinatorial computing

KW - compositions

KW - subsets

UR - https://www.scopus.com/pages/publications/0016994626

U2 - 10.1145/360336.360343

DO - 10.1145/360336.360343

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0016994626

SN - 0001-0782

VL - 19

SP - 517

EP - 521

JO - Communications of the ACM

JF - Communications of the ACM

IS - 9

ER -

Efficient Generation of the Binary Reflected Gray Code and Its Applications

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this