Thumbnail
Access Restriction
Subscribed

Author Salzer, Herbert E.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Galois sum ♦ Gray code ♦ Binary system ♦ Ordering ♦ Positive monotonic functions ♦ Sign sequences
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.
Description Affiliation: Brooklyn, NY (Salzer, Herbert E.)
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 16
Issue Number 3
Page Count 2
Starting Page 180
Ending Page 181


Open content in new tab

   Open content in new tab
Source: ACM Digital Library