Thumbnail
Access Restriction
Subscribed

Author Ehrlich, Gideon ♦ Reingold, Edward M. ♦ Bitner, James R.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Gray code ♦ Compositions ♦ Combinations ♦ Subsets ♦ Combinatorial computing
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.
Description Affiliation: Univ. of Illinois, Urbana (Reingold, Edward M.) || Univ. of Texas, Austin (Bitner, James R.) || Bar-Ilan Univ., Ramat-Gan, Israel (Ehrlich, Gideon)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 19
Issue Number 9
Page Count 5
Starting Page 517
Ending Page 521


Open content in new tab

   Open content in new tab
Source: ACM Digital Library