galois.BCH.d - galois

property galois.BCH.d : int

The minimum distance $d$ of the $[n, k, d]_{q}$ code.

Notes¶

The minimum distance of a BCH code may be greater than the design distance, i.e. $d_{m i n} \geq d$ .

Examples¶

Construct a binary $BCH (15, 7)$ code.

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

Construct a $BCH (26, 14)$ code over $GF (3)$ .

In [3]: bch = galois.BCH(26, 14, field=galois.GF(3)); bch
Out[3]: <BCH Code: [26, 14, 7] over GF(3)>

In [4]: bch.d
Out[4]: 7