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

21Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

Lower bounds on the number of permutations p of {1, 2,⋯, n satisfying |p i - i| ≤ d for all i are given. © 2010 The Author(s).

Cite

CITATION STYLE

APA

Kløve, T. (2011). Lower bounds on the size of spheres of permutations under the Chebychev distance. In Designs, Codes, and Cryptography (Vol. 59, pp. 183–191). https://doi.org/10.1007/s10623-010-9454-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free