Distance Enumerators for Permutation Groups

DOI10.1080/00927870701405017zbMath1127.20001OpenAlexW2157625186MaRDI QIDQ5426293

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

zbMATH Keywords

wreath productsfinite permutation groupsdirect productsnumbers of fixed pointscycle indicesdistance enumeratorsgeneralised hyperoctahedral groups

Mathematics Subject Classification ID

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

Related Items (3)

Unnamed Item ⋮ Permutation codes ⋮ Error-correcting codes from permutation groups

Uses Software

• GAP

Cites Work

• Uncoverings-by-bases for base-transitive permutation groups.
• Coding with permutations
• Unnamed Item

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