Page "BCH code" Paragraph 45

2.

A BCH code has minimal Hamming distance at least.

Proof: We only give the proof in the simplified case ; the general case is similar.

Suppose that is a code word with fewer than non-zero terms.

Then