#13771: Canonical Forms and Automorphism Groups of linear codes
-------------------------------------------------+-------------------------
Reporter: tfeulner | Owner: wdj
Type: enhancement | Status:
Priority: major | needs_review
Component: coding theory | Milestone: sage-5.13
Keywords: linear code, canonical form, | Resolution:
automorphism group, semilinear equivalent | Merged in:
Authors: Thomas Feulner | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: #13726 | Stopgaps:
-------------------------------------------------+-------------------------
Comment (by dimpase):
Replying to [comment:14 vbraun]:
> If you look at the docstring of `class LinearCodeAutGroupCanLabel` then
you'll see. There is just permutations and only linear maps as subgroups,
but currently you need to dig into the innards to construct them.
If the same algorithm works for any (or some other nontrivial well-defined
class, e.g. the normal subgroups) of the subgroups of the semimonomial
group, then there should be a proper interface for this exposed.
--
Ticket URL: <http://trac.sagemath.org/ticket/13771#comment:15>
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.
