Gray code
Named by 2 essays across 2 fields — each of them below, with the objects they name alongside it.
Also named here as karnaugh map — the same set of essays touches all of them, so they are one junction rather than several.
The map that puts neighbours side by side
Reorder the rows of a truth table so that neighbouring squares differ in one letter, and finding a short formula stops being algebra and becomes the problem of covering a shape with rectangles.
A walk that changes one thing at a time
Counting from nothing to fifteen in binary changes four digits at once somewhere in the middle. There is another order through the same sixteen words in which every step changes exactly one — and it is a closed walk on a four-dimensional cube.
Named alongside it
The objects these essays reach for when they reach for this one.
HypercubeKarnaugh mapParityBinaryComplete graphCounting argumentCoveringGraphHamming distanceMinimalityNormal formPrime implicant