#20100: A new structure for Cyclic codes
-----------------------------+----------------------------
Reporter: dlucas | Owner:
Type: enhancement | Status: new
Priority: major | Milestone: sage-7.1
Component: coding theory | Keywords:
Merged in: | Authors:
Reviewers: | Report Upstream: N/A
Work issues: | Branch:
Commit: | Dependencies:
Stopgaps: |
-----------------------------+----------------------------
This ticket proposes a new implementation for cyclic codes.
It contains:
- a new code class, `CyclicCode`,
- a dedicated encoder to compute the generator matrix of a Cyclic Code,
and
- an encoder whose message space is a polynomial ring.
This new structure has the following features:
- it is now possible to build a cyclic code in three different ways:
- either by using the generator polynomial, which is passed as an
argument,
- either by using the defining set, which is passed as an argument (and
can even be partial), or
- by passing a linear code as argument. In that case, a generator
polynomial will be computed (if possible) and used to reformat the input
code as a cyclic code.
- it also comes with a method to compute the BCH bound, either from a
constructed code or directly from the necessary parameters.
--
Ticket URL: <http://trac.sagemath.org/ticket/20100>
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.
