Designs, Codes and Cryptography

, Volume 59, Issue 1, pp 183-191

First online:

Open Access This content is freely available online to anyone, anywhere at any time.

Lower bounds on the size of spheres of permutations under the Chebychev distance

  • Torleiv KløveAffiliated withDepartment of Informatics, University of Bergen Email author 


Lower bounds on the number of permutations p of {1, 2, . . . , n} satisfying |p i i| ≤ d for all i are given.


Permutations Chebychev distance Spheres

Mathematics Subject Classification (2000)

05A05 94B65