The Hamming distance between two permutations of a finite setX is the number of elements ofX on which they differ. In the first part of this paper, we consider bounds for the cardinality of a subset (or subgroup) of a permutation groupP onX with prescribed distances between its elements. In the second part. We consider similar results for sets ofs-tuples of permutations; the role of Hamming distance is played by the number of elements ofX on which, for somei, the ith permutations of the two tuples differ.
['Peter J. Cameron', 'Michel Deza', 'Peter Frankl']
Intersection theorems in permutation groups