| Efficient generation of the binary reflected gray code and its applications |
| Full text |
Pdf
(485 KB)
|
Source
|
Communications of the ACM
archive
Volume 19 , Issue 9 (September 1976)
table of contents
Pages: 517 - 521
Year of Publication: 1976
ISSN:0001-0782
|
|
Authors
|
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 18, Downloads (12 Months): 105, Citation Count: 18
|
|
|
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.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
 |
2
|
|
| |
3
|
Dershowitz, N. A simplified loop-free algorithm for generating permutations. BIT 15, 2 (1975), 158-164.
|
 |
4
|
|
 |
5
|
|
| |
6
|
Flores, I. Reflected number systems. IRE Trans. Electron. Comput. 5, 2 (June 1956), 79-82.
|
| |
7
|
Gilbert, E.N. Gray codes and paths on the n-cube. Bell Syst. Tech. J. 37, 9 (May 1958), 815-826.
|
| |
8
|
Gray, F. Pulse code communications. U.S. Patent 2 632 058, March 17, 1953.
|
| |
9
|
Lenstra, J.W., and Rinnooy Kan, A.H.G. A recursive approach to the generation of combinatorial configurations. Rep. BW 50/75, Mathematisch Centrum, Amsterdam, 1975.
|
 |
10
|
|
 |
11
|
|
| |
12
|
Tang, D.T., and Liu, C.N. Distance 2-cyclic chaining of constant weight codes. IEEE Trans. Comput. 22, 2 (Feb. 1973), 176-180.
|
CITED BY 18
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Leo J. Guibas , Edward M. McCreight , Michael F. Plass , Janet R. Roberts, A new representation for linear lists, Proceedings of the ninth annual ACM symposium on Theory of computing, p.49-60, May 04-04, 1977, Boulder, Colorado, United States
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|