#20201: Improving Efficiency of LinearCode.NearestNeighborDecoder method
-----------------------------+----------------------------------
Reporter: arpitdm | Owner:
Type: PLEASE CHANGE | Status: new
Priority: major | Milestone: sage-7.1
Component: coding theory | Keywords: beginner
Merged in: | Authors: Arpit Merchant
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-----------------------------+----------------------------------
The `decode_to_code` method of the current implementation of the
`NearestNeighborDecoder` creates and stores the distances between the
received word and every codeword. It then sorts the entire list in order
to find the closest codeword. This takes asymptotic memory and time in the
size of the code which can be very inefficient for large input.
This should be improved.
--
Ticket URL: <http://trac.sagemath.org/ticket/20201>
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.
