<p>According to the articles that i read (also wikipedia [1]), they refer that the above algorithm works on finite field $GF(q)$. But I cannot find an evidence that it still works on extension field, i.e: $GF(q^n)$.
It looks like from the algorithm itself that there is no problem, but I rather like an expert opinion.</p>

<p>[1]- <a href="https://en.wikipedia.org/wiki/Berlekamp%E2%80%93Massey_algorithm#CITEREFReedsSloane1985" rel="nofollow noreferrer">https://en.wikipedia.org/wiki/Berlekamp%E2%80%93Massey_algorithm#CITEREFReedsSloane1985</a> </p>

CC BY-SA 3.0
2017-06-17T11:43:25.270Z
Wikipedia says it works for an arbitrary field. It does not mention prime fields, if that's what you mean by $q$.
Emil Jeřábek
CC BY-SA 3.0
2017-06-17T12:00:04.577Z
Yes I know and yet, I'm trying to find an explicit justification that it works on extension field. Because I depend on that fact in an article that I'm writing.
user1387682
CC BY-SA 3.0
2017-06-17T22:45:02.810Z
Apologies for sounding grumpy, but if this algorithm is essential to your article, maybe you should read original articles and understand the algorithm yourself, rather than rely on wikipedia and stackexchange.
Sasho Nikolov
CC BY-SA 3.0
2017-06-18T12:29:15.290Z
I agree with @SashoNikolov, for example at a minimum you can code the algorithm for say $GF(4)$ and test it for all sequences up to some small length and confirm.
kodlu
<ds.algorithms><finite-fields>
Is berklemap-massey works on extention field
user1387682
# Is berklemap-massey works on extention field

(Asked by: username_0 on 2017-06-17)

According to the articles that i read (also wikipedia [1]), they refer that the above algorithm works on finite field $GF(q)$. But I cannot find an evidence that it still works on extension field, i.e: $GF(q^n)$.
It looks like from the algorithm itself that there is no problem, but I rather like an expert opinion.

[1]- <https://en.wikipedia.org/wiki/Berlekamp%E2%80%93Massey_algorithm#CITEREFReedsSloane1985>

**Tags:** ds.algorithms, finite-fields

> **Comments:**
> **username_1**: Wikipedia says it works for an arbitrary field. It does not mention prime fields, if that's what you mean by $q$.  
> **username_0**: Yes I know and yet, I'm trying to find an explicit justification that it works on extension field. Because I depend on that fact in an article that I'm writing.  
> **username_2**: Apologies for sounding grumpy, but if this algorithm is essential to your article, maybe you should read original articles and understand the algorithm yourself, rather than rely on wikipedia and stackexchange.  
> **username_3**: I agree with @SashoNikolov, for example at a minimum you can code the algorithm for say $GF(4)$ and test it for all sequences up to some small length and confirm.  

---

## 0 answers

