#14973: New functions for binary linear codes
---------------------------------+-------------------------
Reporter: veronica | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-5.12
Component: coding theory | Resolution:
Keywords: binary codes | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
---------------------------------+-------------------------
Comment (by veronica):
The next patch is presented as result of a GSoC project 2013.
The work contains implementation of new decoding algorithms for linear
codes proposed in "Combinatorial Commutative Algebra Approach to Complete
Decoding", PhD Thesis, University of Valladolid, 2013 by Irene Marquez-
Corbella.
Algorithms are called `"groebner representation"` and `"groebner basis"`
and has been added to `sage.coding.decoder.py`
This algorithms has been hooked up with the `decode` function in
`sage.coding.linear_code.py`, adding also a block of tests in which is
explained the cases where this new algorithms performs better.
The patch contains functions added to `sage.coding.linear_code.py` such
as `coset_leaders`, `error_correcting_capacity`, `newton_radius`,
`weight_distribution_coset`, and new algorithm to `covering_radius`.
--
Ticket URL: <http://trac.sagemath.org/ticket/14973#comment:12>
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/groups/opt_out.
