For a binary code, minimum distance is the smallest number of bit inversions separating any two distinct codewords; it defines a guaranteed detection bound, not an observed error rate. [1] Hesela's exhaustive four-bit example drops from distance three to two when the data length increases from eleven to twelve bits. [2]
hesela.dev