Abstract
The algorithm generates a list of distinct binaryn-tuples such that eachn-tuple differs from the one preceding it in just one coordinate [1]. The binary Gray code is often used to generate all subsets of a given set [2]. The whole theory can easily be generalized to generatingr-ary codes,r>2, [3].
Zusammenfassung
Der Algorithmus erzeugt eine Liste von verschiedenen binärenn-Tupeln, so daß jedesn-Tupel sich vom vorhergehenden in genau einer Koordinate unterscheidet [1]. Der binäre Gray-Code wird oft zur Erzeugung aller Teilmengen einer gegebenen Menge verwendet [2]. Die gesamte Theorie kann leicht auf die Erzeugungr-närer Codes,r>2, verallgemeinert werden [3].
This is a preview of subscription content, log in via an institution to check access.
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Gilbert, E. N.: Gray codes and paths on then-cube. Bell System Tech. J.1958, 815.
Wells, M. B.: Elements of combinatorial computing. Pergamon Press 1971.
Kantz, W. H.: A readily implemented single-error-correcting unit-distance counting code. IEEE Trans. on Computers (Oct. 1970).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mossige, S. An algorithm for Gray codes. Computing 18, 89–92 (1977). https://doi.org/10.1007/BF02248780
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02248780