Hi Panos
The snippet you gave certainly does not work since it will compute the gcd
of 1 and something else, which is - of course - 1.
What you need is to compute the *half gcd* of R and g, i.e. run the
Extended Euclidean algorithm about half-way and then stop. The Bezout
relation from that i
Thanks Johan,
I finally implement the decoder using lattice basis reduction (using LLL)
The only thing left is to reduce the execution time of the decoder by
finding the most efficient way to locate the errors via the error locator
poynomial (something better than chien search)
If you are inter
Hi Panos,
> I finally implement the decoder using lattice basis reduction (using LLL)
I presume you mean F[x]-lattice basis reduction, i.e. row reduction of
F[x] matrices (the LLL is for integer matrices).
> The only thing left is to reduce the execution time of the decoder by
> finding the mo
Panos,
I had write patterson algorithm here
http://juaninf.blogspot.com.br/2013/04/function-make-div-with-id-mycell-sage.html
.
2017-03-07 9:47 GMT-03:00 Johan S. H. Rosenkilde :
> Hi Panos,
>
> > I finally implement the decoder using lattice basis reduction (using LLL)
>
> I presume you mean F[
