Open Access
Article

Designs, Codes and Cryptography

, Volume 59, Issue 1, pp 183-191

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

Authors

  • Torleiv Kløve
    • Department of InformaticsUniversity of Bergen

DOI: 10.1007/s10623-010-9454-0

Abstract

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

Keywords

Permutations Chebychev distance Spheres

Mathematics Subject Classification (2000)

05A05 94B65

Acknowledgments

This research was supported by The Norwegian Research Council.

Open Access

This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.

Copyright information

© The Author(s) 2010