#18813: New decoding structure for linear codes
-------------------------+-------------------------------------------------
Reporter: | Owner:
dlucas | Status: needs_review
Type: | Milestone: sage-6.10
enhancement | Resolution:
Priority: major | Merged in:
Component: | Reviewers:
coding theory | Work issues:
Keywords: | Commit:
Authors: David | ddd1eb1f28e3d34dfc83a8ae401495b7cad432b8
Lucas | Stopgaps:
Report Upstream: N/A |
Branch: |
u/dlucas/decoder |
Dependencies: |
#18376 |
-------------------------+-------------------------------------------------
Comment (by cpernet):
I'm confused by the syndrome method.
It really looks to me as a "NearestNeighbor" decoding, not as syndrome
decoding.
Syndrome decoding means (following Roth's Book)
1/ compute the syndrome s=Hy where H is the parity check matrix
2/ Among the coset of vectors sharing the same syndrome, return the coset
leader, with minimal Hamming weight
I don't see any parity check matrix here, and the output is simply the
leader of the coset of **all** r+C vectors.
--
Ticket URL: <http://trac.sagemath.org/ticket/18813#comment:27>
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 http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
