Distance Enumerators for Permutation Groups

DOI10.1080/00927870701405017zbMATH Open1127.20001OpenAlexW2157625186MaRDI QIDQ5426293FDOQ5426293

Authors: Robert F. Bailey, Jonathan P. Dixon 

Publication date: 12 November 2007

Published in: Communications in Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00927870701405017

Recommendations

• On the distance from permutations to the union of all imprimitive groups with identical parameters of imprimitivity systems.
• On the distance from permutations to imprimitive groups for a fixed system of imprimitivity.
• scientific article; zbMATH DE number 4010770
• Intersection theorems in permutation groups
• Induced Cycle Structures of the Hyperoctahedral Group

zbMATH Keywords

finite permutation groupsdirect productswreath productsnumbers of fixed pointscycle indicesdistance enumeratorsgeneralised hyperoctahedral groups

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) General theory for finite permutation groups (20B05) Other types of codes (94B60)

Cites Work

• Title not available (Why is that?)
• Uncoverings-by-bases for base-transitive permutation groups.
• Coding with permutations

Cited In (5)

• Title not available (Why is that?)
• Permutation codes
• On the distance from permutations to the union of all imprimitive groups with identical parameters of imprimitivity systems.
• On the distance from permutations to imprimitive groups for a fixed system of imprimitivity.
• Error-correcting codes from permutation groups

Uses Software

• GAP

This page was built for publication: Distance Enumerators for Permutation Groups

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