Distance enumerators for permutation groups

Communications in Algebra

Volumn 35, Issue 10, 2007, Pages 3045-3051

  Bailey, Robert F ^a   Dixon, Jonathan P ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Cycle index; Distance enumerator; Permutation group

Indexed keywords

EID: 34848927846     PISSN: 00927872     EISSN: 15324125     Source Type: Journal    
DOI: 10.1080/00927870701405017     Document Type: Article

References (8)

1. Bailey, R. F. (2006). Uncoverings-by-bases for base-transitive permutation groups. Des. Codes Cryptogr. 41:153-176.
2. Bailey, R. F., Prellberg, T. Decoding generalised hyperoctahedral groups and asymptotic analysis of correctible error patterns. In preparation.
3. Blake, I. F., Cohen, G., Deza, M. (1979). Coding with permutations. Information and Control 43:1-19.
4. Cameron, P. J. (1994). Combinatorics: Topics, Techniques, Algorithms. Cambridge: Cambridge University Press.
5. Cameron, P. J. (1999). Permutation Groups. London Mathematical Society Student Texts 45. Cambridge: Cambridge University Press.
6. Cameron, P. J., Gewurz, D. A., Merola, F. (2007). Product action. Discrete Math. (in press), DOI:10.1016/j.disc.2006.11.054.
7. Cameron, P. J., van Lint, J. H. (1991). Designs, Graphs, Codes and Their Links. London Mathematical Society Student Texts 22. Cambridge: Cambridge University Press.
8. The GAP Group. (2004). GAP - Groups, Algorithms, and Programming, Version 4.4; (http://www.gap-system.org).