#19623: Syndrome decoder is not a syndrome decoder
-------------------------------------+-------------------------------------
Reporter: dlucas | Owner:
Type: enhancement | Status: positive_review
Priority: major | Milestone: sage-7.1
Component: coding theory | Resolution:
Keywords: | Merged in:
Authors: David Lucas | Reviewers: Julien Lavauzelle,
Report Upstream: N/A | Johan Sebastian Rosenkilde Nielsen
Branch: | Work issues:
u/dlucas/generic_decoders | Commit:
Dependencies: | 2bef528d821af2b822fbca47d4f4928f2b0131ad
| Stopgaps:
-------------------------------------+-------------------------------------
Changes (by jsrn):
* status: needs_review => positive_review
Comment:
Hah, that's pretty funny: before, the syndrome decoder was actually a
nearest neighbor decoder, and therefore ran in `q^k`. Now, it's really a
syndrome decoder and runs in `q^(n-k)`, which is too big for the previous
example in the tutorial.
Perhaps, a linear code should default to using syndrome or nearest
neighbor depending on which of `q^(n-k)` or `q^k` is biggest?
For this ticket: green again.
--
Ticket URL: <http://trac.sagemath.org/ticket/19623#comment:48>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" 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-trac.
For more options, visit https://groups.google.com/d/optout.
