Minimum bases for permutation groups: the greedy approximation
Journal of Algorithms
Bases for permutation groups and matroids
European Journal of Combinatorics
Upper bounds on permutation codes via linear programming
European Journal of Combinatorics
Intersecting families of permutations
European Journal of Combinatorics
Uncoverings-by-bases for base-transitive permutation groups
Designs, Codes and Cryptography
Remoteness of permutation codes
European Journal of Combinatorics
Hi-index | 0.00 |
There are many analogies between subsets and permutations of a set, and in particular between sets of subsets and sets of permutations. The theories share many features, but there are also big differences. This paper is a survey of old and new results about sets (and groups) of permutations, concentrating on the analogies and on the relations to coding theory. Several open problems are described.