Free public beta until December 4, 2026: every course is open, no card needed. After that, the first chapter of each course stays free and full access is a one-time $39 ($19 for up to 100 founding members chosen for helpful feedback). Your progress is kept. How the beta works

Hamming distance

The number of positions where two equal-length bit-strings disagree.

For $x,y \in \{0,1\}^n$ , $d_H(x,y)$ counts the coordinates where $x$ and $y$ differ; a code's minimum distance $d_{\min}$ is the smallest $d_H$ between any two distinct codewords.

Read the full section →

snap pen only

Graph settings

indep dep deg

grid intersections

xmin xmax ymin ymax

x-tick y-tick

Calculator