scientific article; zbMATH DE number 1004935
From MaRDI portal
Publication:4335298
zbMath0872.20002MaRDI QIDQ4335298
Publication date: 19 August 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
partitionsalgorithmsefficiencyautomorphism groupsnormalizersrefinementsstrong generating setsbacktrack searchespermutation group computations
Related Items (18)
All \(\mathbb{Z}_ 4\) codes of type II and length 16 are known ⋮ Perfect refiners for permutation group backtracking algorithms ⋮ Computing isomorphisms of association schemes and its application ⋮ The contact polytope of the Leech lattice ⋮ A finiteness theorem for specializations of dynatomic polynomials ⋮ Fast computation of the centralizer of a permutation group in the symmetric group ⋮ Moduli of polarised Enriques surfaces — Computational aspects ⋮ Good integers and some applications in coding theory ⋮ Hulls of double cyclic codes ⋮ Hulls of cyclic and negacyclic codes over finite fields ⋮ Hulls of cyclic codes over \(\mathbb{Z}_4\) ⋮ An adaptive prefix-assignment technique for symmetry reduction ⋮ Calculating subgroups with GAP ⋮ Permutation group algorithms based on directed graphs ⋮ Computing the group of an algebraic variety over a finite field ⋮ Computing canonical images in permutation groups with graph backtracking ⋮ The average dimension of the hull of cyclic codes. ⋮ A local–global principle in the dynamics of quadratic polynomials
Uses Software
This page was built for publication:
