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 most efficient way to locate the errors via the error locator > poynomial (something better than chien search). Look up "multi-point evaluation" for asymptotically fast algorithms. > If you are interesting in Goppa codes there is a module named codinglib at > bitbucket witch is very helpful and a really great base. I know - I'm the author ;-) But thanks. Best, Johan Panos Phronimos writes: > 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 interesting in Goppa codes there is a module named codinglib at > bitbucket witch is very helpful and a really great base. -- -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
