GLITCH // GRAPH LAB

Hamming distance explorer

Closest-neighbor graph

Each binary string becomes a node. An edge appears when either endpoint names the other among its closest strings. Ties create several edges.

16 strings

Separate strings with spaces, commas, or new lines. Every string must have the same length.

The default list contains all 16 codewords of the Hamming(7,4) code used in the lesson.

Nearest connections

mutual closest closest for one endpoint edge number = Hamming distance