Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

Gray code and the ± sign sequence when ±f(±f(±f(•••±f(x)•••))) is ordered

Published: 01 March 1973 Publication History

Abstract

A previous note gives a rule for determining the sequence of + and - signs to obtain the ith largest value of +ƒ(±ƒ(±ƒ(··· ±ƒ(x)···))) when ƒ(x) is positive and monotonic [1, p. 46, §2]. Shortly after publication the writer received a letter dated March 9, 1972, from John Murchland, of the Planning & Transport Research & Computation Co. Ltd., London, in which he mentioned that the conversion scheme for obtaining the ± sign sequence from i - 1 happens to be also the standard way of going from a binary number to its Gray code equivalent, when after the conversion every plus sign is replaced by 0 and every minus sign by 1.

References

[1]
Salzer, H.E. Ordering +f(+f(4-f(. -4-f(x).))) when f(x) is positive monotonic. Comm. ACM 15, 1 (Jan. 1972), 45-46.
[2]
Gardner, M. The curious properties of the Gray code and how it can be used to solve puzzles. Sci. Amer. 227, 2 (Aug. 1972), 106-109.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Communications of the ACM
Communications of the ACM  Volume 16, Issue 3
March 1973
57 pages
ISSN:0001-0782
EISSN:1557-7317
DOI:10.1145/361972
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1973
Published in CACM Volume 16, Issue 3

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Galois sum
  2. Gray code
  3. binary system
  4. ordering
  5. positive monotonic functions
  6. sign sequences

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)42
  • Downloads (Last 6 weeks)13
Reflects downloads up to 09 Nov 2024

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media