neighbouring numbers differ in one bit: converting from binary and back without a table
Built as a memo rather than a table: the thing worth hanging it up for reads across the room, with the full reference in smaller type below it.
Three sizes in one archive — from a sheet on the fridge to a poster on the wall.
The disc is in the Gray code: one ring per bit, the leftmost bit innermost; dark means 1; the thick line is the boundary between 7 and 8.
Frank Gray of Bell Labs coined the name “reflected binary code” in his 1947 patent application, noting that the code had “as yet no recognized name”. The patent was granted in 1953, and others who used the code later named it after him. But Gray was not the first to reach such a code: George Stibitz, also of Bell Labs, described one in a 1941 patent application, and in 1875 or 1876 Émile Baudot was already ordering the letters on the print wheel of his telegraph using a reflected binary code.
Why the numbers can be trusted. Every countable number here is computed from data rather than typed in, and the sheet must pass 4 independent checks before it is allowed to build — how many items there are, the order they come in, and the claim in the highlighted box itself. If one fails, there is no file.
ten tasks, the year of each, the system, the figure — and the human it was measured against
all 128 positions: the column is the three high bits, the row is the four low ones
who published each standard, when, what it does to the sound, and how many bits per second it allows
forty bits to a quantum: five bytes, eight characters and five padding cases