The design distance \(d\) of the \([n, k, d]_2\) code. The minimum distance of a BCH code may be greater than the design distance, \(d_{min} \ge d\).

Examples¶

In [1]: bch = galois.BCH(15, 7); bch
Out[1]: <BCH Code: [15, 7, 5] over GF(2)>

In [2]: bch.d
Out[2]: 5