Content deleted Content added
m Proper minus signs and other cleanup. Report bugs, errors, and suggestions at User talk:MinusBot |
m →Pseudocode: {{sxhl}} Tag: nowiki added |
||
Line 95:
The algorithm from {{Harvtxt|Massey|1969|p=124}} for an arbitrary field:
<!-- Notes: notation changes from Massey:
Massey Here
Line 105 ⟶ 104:
T(D) T(x) polynomial
-->
polynomial(field ''K'') s(x) = ... /* coeffs are s<sub>j</sub>; output sequence as N-1 degree polynomial) */
/* connection polynomial */
Line 141 ⟶ 139:
In the case of binary GF(2) BCH code, the discrepancy d will be zero on all odd steps, so a check can be added to avoid calculating it.
{{sxhl|2=c|1=<nowiki/>
/* ... */
for (n = 0; n < N; n++) {
Line 150 ⟶ 148:
}
/* ... */
}}
==See also==
| |||