Advertisement

Computing

, Volume 18, Issue 1, pp 89–92 | Cite as

An algorithm for Gray codes

  • S. Mossige
Short Communication

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

Keywords

Computational Mathematic Gray Code Binary Gray Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Ein Algorithmus für Gray-Codes

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Gilbert, E. N.: Gray codes and paths on then-cube. Bell System Tech. J.1958, 815.Google Scholar
  2. [2]
    Wells, M. B.: Elements of combinatorial computing. Pergamon Press 1971.Google Scholar
  3. [3]
    Kantz, W. H.: A readily implemented single-error-correcting unit-distance counting code. IEEE Trans. on Computers (Oct. 1970).Google Scholar

Copyright information

© Springer-Verlag 1977

Authors and Affiliations

  • S. Mossige
    • 1
  1. 1.Department of MathematicsUniversity of BergenBergenNorway

Personalised recommendations