All Questions
1
question with no upvoted or accepted answers
1
vote
0
answers
48
views
Transforming a polynomial sum using a series expansion (BCH codes)
In my study of BCH codes I've come across the following equation (the "key equation"):
$$
\Omega(x) \equiv \Lambda(x)S(x) \mod x^{n-k} \tag{1}
$$
Where the two terms on the right are defined by:
$$
...
- 573