论文信息 - Lower bounds on the size of spheres of permutations under the Chebychev distance - 字舞流文

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

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

Torleiv Kløve | T. Kløve

[1] Bolyai János Matematikai Társulat,et al. Combinatorial theory and its applications , 1970 .

[2] Anxiao Jiang,et al. Rank modulation for flash memories , 2008, 2008 IEEE International Symposium on Information Theory.

[3] J. H. van Lint,et al. A Course in Combinatorics: Turán's theorem and extremal graphs , 2001 .

[4] Moshe Schwartz,et al. Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme , 2009, IEEE Transactions on Information Theory.

[5] Torleiv Kløve,et al. Permutation Arrays Under the Chebyshev Distance , 2009, IEEE Transactions on Information Theory.

[6] James L. Massey,et al. Review of 'Error-Correcting Codes, 2nd edn.' (Peterson, W. W., and Weldon, E. J., Jr.; 1972) , 1973, IEEE Trans. Inf. Theory.

[7] W. W. Peterson,et al. Error-Correcting Codes. , 1962 .

[8] René Lagrange. Quelques résultats dans la métrique des permutations , 1962 .

[9] Richard M. Wilson,et al. A course in combinatorics , 1992 .

[10] N. J. A. Sloane,et al. The On-Line Encyclopedia of Integer Sequences , 2003, Electron. J. Comb..

[11] Anxiao Jiang,et al. Error-correcting codes for rank modulation , 2008, 2008 IEEE International Symposium on Information Theory.

[12] F. Lemmermeyer. Error-correcting Codes , 2005 .

[13] H. W. Gould. An identity involving stirling numbers , 1965 .