# Solomon Golomb

> 1932–2016 · Mathematician
>
> **Recorded contribution:** Polyomino theory; shift register sequences; Golomb ruler

## How to use this dossier

Read for a causal chain, not a hero story: inherited problem → contribution → mechanism → downstream capability → limit. Then close the page and complete the reconstruction exercise from memory.

## 1. Historical orientation

Solomon Golomb (1932–2016) was a mathematician and engineer whose work joined recreational mathematics, combinatorics, coding, radar, and space communication. He named and developed polyominoes, but his central computing-and-communications contribution was the theory of shift-register sequences: deterministic binary sequences with long periods and useful correlation properties generated by simple feedback circuits. Such sequences became tools for spread-spectrum communication, ranging, coding, and testing. A maximum-length sequence is not random; its value is that a compact rule produces repeatable behavior resembling randomness in selected statistics.

## 2. The problem inherited

Communication and radar systems needed long, reproducible binary patterns with balanced symbols and sharp correlation, but storing arbitrary long sequences was costly.

## 3. The central contribution

Golomb systematized linear-feedback shift-register sequences and their mathematical properties, showing how tiny state machines generate long pseudorandom codes.

## 4. Reconstruct the mechanism

1. Store n bits in a shift register and choose tap positions corresponding to a feedback polynomial over the field GF(2).
2. At every clock, XOR the tapped bits to form a new bit and shift the remaining state by one position.
3. Choose a primitive polynomial so every nonzero n-bit state appears once before the sequence repeats with period 2^n−1.
4. Correlate a received signal against the same locally generated sequence to detect alignment despite noise or shared spectrum.

## 5. What changed downstream

- Pseudorandom sequences became foundational in CDMA, GPS ranging, radar, telemetry, and hardware testing.
- Golomb's polyomino work influenced tiling theory, puzzles, and the design lineage that included Tetris.
- His ruler and sequence problems connected discrete mathematics with engineering design.

## 6. Attribution, limits, and uncertainty

- Linear-feedback sequences are predictable from enough output and are unsuitable as cryptographic randomness by themselves.
- Engineering applications depend on many communications researchers and standards teams beyond Golomb's theory.
- Good balance and autocorrelation do not make a deterministic sequence statistically ideal for every purpose.

## 7. Reconstruction lab

Implement a four-bit LFSR, try two feedback polynomials, and enumerate each state cycle. Measure symbol balance and cyclic autocorrelation, then recover the recurrence from observed bits to demonstrate why the generator is not cryptographically secure.

## 8. Evidence trail

- [Solomon W. Golomb](https://en.wikipedia.org/wiki/Solomon_W._Golomb) — Wikimedia Foundation
- [Shift Register Sequences](https://archive.org/details/shiftregisterseq0000golo) — Internet Archive

---

*Research checked 2026-08-09. Dates, roles, and claims about living people are historical snapshots. Linked sources remain the authority; this dossier is original instructional synthesis.*