Canonical Forms and Automorphisms in the Projective Space

MaRDI QIDQ6241697zbMATH OpenFDO

Authors Thomas Feulner

Publication date 6 May 2013

Mathematics Subject Classification ID

Group actions on combinatorial structures (05E18) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Abstract: Let $C$ be a sequence of multisets of subspaces of a vector space $F_q^k$. We describe a practical algorithm which computes a canonical form and the stabilizer of $C$ under the group action of the general semilinear group. It allows us to solve canonical form problems in coding theory, i.e. we are able to compute canonical forms of linear codes, $F_q$-linear block codes over the alphabet $F_{q^s}$ and random network codes under their natural notion of equivalence. The algorithm that we are going to develop is based on the partition refinement method and generalizes a previous work by the author on the computation of canonical forms of linear codes.

This page was built for publication: Canonical Forms and Automorphisms in the Projective Space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6241697)