On 19-09-01 08:34:52, Markéta Sluková wrote:
> If you are looking to improve the Goppa ticket, it would be great to have
> Patterson's decoding algorithm implemented. :)
This sounds like an interesting challenge, I might have a look at it
after finishing my degree (which should be this month)
I just wrote a method to get bounded error to test the decoders and am
fighting with timeit, so it might take 2 3 weeks still
>
> On Sunday, 1 September 2019 14:59:28 UTC+2,
mailinglists-sa...@927589452.de
> wrote:
> >
> > On 19-09-01 05:23:23, Markéta Sluková wrote:
> > > I see, is your question why all of them are not the same generating
> > > polynomial?
> > >
> > and not the same field
> >
> > > I think it's better to include a variety of examples in the docs to
> > extend
> > > the area that is being tested when you run the doc tests :) For example,
> > if
> > > you only had examples of one polynomial over one field, things could
> > crash
> > > on a different field with a different polynomial. However, this is my
> > > understanding of doc tests in Sage and I could be wrong :)
> > >
> >
> > I think so too, but then it would be sensible to make it really diverse
> > and include a different example per doc test, wouldn't it?
> >
>
> --
> You received this message because you are subscribed to the Google Groups "sage-coding-theory" group.
> To unsubscribe from this group and stop receiving emails from it, send an email to
sage-coding-the...@googlegroups.com.
> To view this discussion on the web visit
https://groups.google.com/d/msgid/sage-coding-theory/e3bdb49e-c2bc-4f90-8d80-4d874ef5a6db%40googlegroups.com.