Permutation group algorithms based on partitions. I: Theory and algorithms
From MaRDI portal
Publication:1192233
DOI10.1016/S0747-7171(08)80103-4zbMath0807.20001MaRDI QIDQ1192233
Publication date: 27 September 1992
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
algorithmssymmetric groupsconjugacypermutation groupsnormalizerscentralizersbasesbacktrack searchstabilizersordered partitionsset imagesimplementations\({\mathcal R}\)-basescomputation of subgroupscoset intersectionscoset type problemsgroup intersectionsleft cosetsrefinement processesset stabilizersstrong generating setssubgroup-type problems
Symbolic computation and algebraic computation (68W30) Series and lattices of subgroups (20D30) Generators, relations, and presentations of groups (20F05) Software, source code, etc. for problems pertaining to group theory (20-04)
Related Items
Towards Efficient Normalizers of Primitive Groups ⋮ Conjugacy classes and centralisers in wreath products ⋮ All \(\mathbb{Z}_ 4\) codes of type II and length 16 are known ⋮ Perfect refiners for permutation group backtracking algorithms ⋮ New Galois hulls of generalized Reed-Solomon codes ⋮ Symmetry-based matrix factorization ⋮ The contact polytope of the Leech lattice ⋮ MDS codes with euclidean and Hermitian hulls of flexible dimensions and their applications to EAQECCs ⋮ BCH codes with larger dimensional hull ⋮ Optimal quaternary linear codes with one-dimensional Hermitian hull and related EAQECCs ⋮ On Toeplitz codes of index \(t\) and isometry codes ⋮ An improved method for constructing formally self-dual codes with small hulls ⋮ On MDS codes with Galois hulls of arbitrary dimensions ⋮ Several classes of Galois self-orthogonal MDS codes and related applications ⋮ Fast computation of the centralizer of a permutation group in the symmetric group ⋮ Galois hulls of constacyclic codes over finite fields ⋮ On the hulls of cyclic codes of oddly even length over \(\mathbb{Z}_4\) ⋮ Linear codes of larger lengths with Galois hulls of arbitrary dimensions and related entanglement-assisted quantum error-correcting codes ⋮ Moduli of polarised Enriques surfaces — Computational aspects ⋮ Computational group theory. Abstracts from the workshop held August 15--21, 2021 (hybrid meeting) ⋮ Good integers and some applications in coding theory ⋮ Optimal quaternary Hermitian LCD codes and their related codes ⋮ Hulls of double cyclic codes ⋮ Constructing transitive permutation groups. ⋮ Orderly generation of half regular symmetric designs via Rahilly families of pre-difference sets ⋮ Minimal and canonical images ⋮ On leaf permutative theories and occurrence permutation groups ⋮ New refiners for permutation group search ⋮ Hulls of cyclic and negacyclic codes over finite fields ⋮ On the complexity of deduction modulo leaf permutative equations ⋮ Constructions and bounds on quaternary linear codes with Hermitian hull dimension one ⋮ The average dimension of the Hermitian hull of constacyclic codes over finite fields of square order ⋮ Hulls of cyclic codes over \(\mathbb{Z}_4\) ⋮ An adaptive prefix-assignment technique for symmetry reduction ⋮ Linear codes with one-dimensional hull associated with Gaussian sums ⋮ Permutation group algorithms based on directed graphs ⋮ Optimal binary and ternary linear codes with hull dimension one ⋮ Hulls of linear codes revisited with applications ⋮ The average dimension of the hull of cyclic codes. ⋮ Computing symmetry groups of polyhedra ⋮ On the Generation of Rank 3 Simple Matroids with an Application to Terao's Freeness Conjecture ⋮ Hermitian hulls of constacyclic codes and a new family of entanglement-assisted quantum MDS codes ⋮ Exploiting Symmetries in Polyhedral Computations ⋮ MDS linear codes with one-dimensional hull ⋮ Linear codes with small hulls in semi-primitive case ⋮ A new construction of linear codes with one-dimensional hull ⋮ Linear codes with arbitrary dimensional hull and their applications to EAQECCs ⋮ A new method for constructing linear codes with small hulls ⋮ Hermitian hulls of constacyclic codes and their applications to quantum codes
Uses Software
Cites Work
- A general backtrack algorithm for the isomorphism problem of combinatorial objects
- Group-theoretic algorithms and graph isomorphism
- On the centralizers of involutions in finite groups. II
- Computing in Permutation and Matrix Groups II: Backtrack Algorithm
- Computing normalizers in permutation groups
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- On an Algorithm for Finding a Base and a Strong Generating Set for a Group Given by Generating Permutations
- Computing automorphism groups of error-correcting codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
