Permutation arrays under the Chebyshev distance

IEEE Transactions on Information Theory

Volumn 56, Issue 6, 2010, Pages 2611-2617

  Kløve, Torleiv ^a   Lin, Te Tsung ^b   Tsai, Shi Chun ^b   Tzeng, Wen Guey ^b  

^a UNIVERSITY OF BERGEN   (Norway)

^b NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Bounds; Chebyshev distance; Code constructions; Flash memory; Permutation arrays

Indexed keywords

BOUNDS; CHEBYSHEV; CHEBYSHEV METRIC; CODE CONSTRUCTION; PERMUTATION ARRAYS; POWER LINES;

CODES (SYMBOLS);

FLASH MEMORY;

EID: 77957554752     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2046212     Document Type: Article

References (16)

1. P. Cappelletti, C. Golla, P. Olivo, and E. Zanoni, Flash Memories. Norwell, MA: Kluwer, 1999.
2. H. Chadwick and L. Kurz, "Rank permutation group codes based on Kendall's correlation statistic," IEEE Trans. Inf. Theory, vol.IT-15, no.3, pp. 306-315, Mar. 1969.
3. P. Diaconis, Group Representations in Probability and Statistics. Hayward, CA: Inst. Math. Statist., 1988.
4. S. Haykin, Communication Systems, 4th ed. Hoboken, NJ: Wiley, 2001.
5. A. Jiang, R. Mateescu, M. Schwartz, and J. Bruck, "Rank modulation for flash memories," in Proc. IEEE Int. Symp. Information Theory, 2008, pp. 1731-1735.
6. A. Jiang, M. Schwartz, and J. Bruck, "Error-correcting codes for rank modulation," in Proc. IEEE Int. Symp. Information Theory, 2008, pp. 1736-1740.
7. M. Kendall and J. D. Gibbons, Rank Correlation Methods. London, U.K.: Edward Arnold, 1990.
8. T. Kløve, Spheres of Permutations Under the Infinity Norm-Permutations With Limited Displacement, Reports in Informatics, Dept. Informatics, Univ. Bergen, 2008, Report no. 376.
9. T. Kløve, "Generating functions for the number of permutations with limited displacement," Electron. J. Combin., R104, vol.16, no.1, Aug. 2009.
10. T. Kløve, "Lower bounds on the size of spheres of permutations under the Chebychev distance," Designs, Codes and Cryptography, to be published.
11. D. H. Lehmer, "Permutations with strongly restricted displacements," in Combinatorial Theory and its Applications II, P. Erdös, A. Rényi, and V. T. Sós, Eds. Amsterdam, The Netherlands: North Holland, 1970.
12. K. W. Shum, "Permutation coding and MFSK modulation for frequency selective channel," IEEE Personal, Indoor and Mobile Radio Commun., vol.13, pp. 2063-2066, Sep. 2002.
13. R. P. Stanley, Enumerative Combinatorics. Cambridge, U.K.: Cambridge Univ. Press, 1997, vol.I.
14. E. Stoll and L. Kurz, "Suboptimum rank detection procedures using rank vector codes," IEEE Trans. Commun., vol.COM-16, no.6, pp. 402-410, Jun. 1968.
15. I. Tamo and M. Schwartz, Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme, 2009, arXiv:0907.3387.
16. J. H. van Lint and R. M.Wilson, A Course in Combinatorics, 2nd ed. Cambridge, U.K.: Cambridge Univ. Press, 2001.