For binary linear codes with binary phase-shift keying over additive white Gaussian noise at high signal-to-noise ratio, most maximum-likelihood decoding errors involve codewords nearest the one sent. Their number equals that of minimum-weight codewords: nonzero codewords with the fewest ones. Reliability-based polar construction does not always minimize this number. This paper finds the minimum within a family of polar-transform codes of length N=2m. Each code retains all rows with N or N/2 ones and b≥1 rows with N/4 ones, zeroing other inputs, giving minimum distance N/4. For m≥5 and 1≤b≤m, the minimum is 4max{b,3b−m}, with all optimal selections identified. At length 64 with 16 information bits, it is 152, versus a published construction’s 196. On binary-input memoryless symmetric channels, polar codes chosen by exact reliability, with ties respecting the decreasing order, must select certain rows together, so, in this family, they cannot attain the minimum for m≥5 and 2≤b≤m. At lengths 32, 64 and 128, polar codes in this family built for an erasure channel with erasure probability 0.5 have up to 3.29 times the minimum, by exhaustive enumeration.