Correcting limited-magnitude errors in the rank-modulation scheme
IEEE Transactions on Information Theory
Permutation arrays under the Chebyshev distance
IEEE Transactions on Information Theory
Hi-index | 0.00 |
Lower bounds on the number of permutations p of {1, 2, . . . , n} satisfying |p i 驴 i| 驴 d for all i are given.