#20201: Improving Efficiency of LinearCode.NearestNeighborDecoder method
----------------------------------+------------------------
Reporter: arpitdm | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-7.1
Component: coding theory | Resolution:
Keywords: beginner | Merged in:
Authors: Arpit Merchant | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
----------------------------------+------------------------
Comment (by arpitdm):
Solution idea: If `r` is the received codeword, we compute the Hamming
weight for the first codeword `c` in code `C` and store that as minimum.
We then iterate over the rest of the codewords. If a codeword of lesser
Hamming weight is found, the minimum is updated accordingly, else it
remains the same. That way, the memory requirement will be that of a
single codeword and the time would be the O(q^k).
--
Ticket URL: <http://trac.sagemath.org/ticket/20201#comment:2>
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.
