#20201: Improving Efficiency of LinearCode.NearestNeighborDecoder method
-------------------------------------+-------------------------------------
Reporter: arpitdm | Owner:
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-7.2
Component: coding theory | Resolution:
Keywords: beginner | Merged in:
Authors: Arpit Merchant | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/arpitdm/improving_efficiency_of_linearcode_nearestneighbordecoder_method|
170b3fc8ff8e9f7333a06e0c84f552857e911732
Dependencies: | Stopgaps:
-------------------------------------+-------------------------------------
Comment (by jsrn):
Ah, I see now what you used the iterator for: picking out a first element.
However, `c_min` should go with `h_min`, in which case `c_min` should just
be initialised to the zero codeword, e.g. `c_min = self.code().zero()`.
--
Ticket URL: <http://trac.sagemath.org/ticket/20201#comment:11>
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.
