Revision as of 20:22, 30 July 2021 edit 74.96.189.51 (talk) →Primitive narrow-sense BCH codes ← Previous edit		Revision as of 13:52, 1 August 2021 edit undo 74.96.189.51 (talk) →Example Next edit →
Line 17: ==== Example ==== Let {{math\|''q'' {{=}} 2}} and {{math\|''m'' {{=}} 4}} (therefore {{math\|''n'' {{=}} 15}}). We will consider different values of {{mvar\|d}}. For {{math\|GF(16) {{=}} GF(2<sup>4</sup>)}} based on the polynomial {{math\|''x''<sup>4</sup> + ''x'' + 1}} with primitive root {{math\|''α'' {{=}} ''x''+0}} there are minimum polynomials {{math\|''m''<sub>''i''</sub>(''x'')}} with coefficients in {{math\|GF(2)}} satisfying :<math>m_i\left(\alpha^i\right) \bmod \left(x^4 + x + 1\right) = 0.</math>

BCH code: Difference between revisions