Codes in permutations and error correction for rank modulation

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2010, Pages 854-858

  Barg, Alexander ^a,b   Mazumdar, Arya ^a  

^a UNIVERSITY OF MARYLAND   (United States)

^b INSTITUTE FOR INFORMATION TRANSMISSION PROBLEMS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTANT FACTORS; FIXED NUMBERS; FLASH MEMORY DEVICES; KENDALL TAUS; LOWER AND UPPER BOUNDS; OPTIMAL CODES; SPHERE PACKING BOUND;

ERRORS; INFORMATION THEORY; SPHERES;

FLASH MEMORY;

EID: 77955691952     PISSN: 21578103     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2010.5513604     Document Type: Conference Paper

References (12)

1. I. F. Blake, G. Cohen, and M. Deza, "Coding with permutations," Inform. and Control, vol. 43, no. 1, pp. 1-19, 1979.
2. R. C. Bose and S. Chowla, "Theorems in the additive theory of numbers," Commentarii Mathematici Helvetici, vol. 37, no. 1, pp. 141-147, December 1962.
3. H. Chadwick and L. Kurz, "Rank permutation group codes based on Kendall's correlation statistic," IEEE Trans. Inform. Theory, vol. 15, no. 2, pp. 306-315, 1969.
4. H. Chadwick and I. Reed, "The equivalence of rank permutation codes to a new class of binary codes," IEEE Trans. Inform. Theory, vol. 16, no. 5, pp. 640-641, 1970.
5. C. J. Colbourn, T. Kløve, and A. C. H. Ling, "Permutation arrays for power line communications and mutually orthogonal Latin squares," IEEE Trans. Inform. Theory, vol. 50, no. 6, pp. 1289-1291, 2004.
6. P. Diaconis and R. L. Graham, "Spearman's footrule as a measure of disarray," Journal of the Royal Statistical Society, Series B, vol. 39, no. 2, pp. 262-268, 1977.
7. A. Jiang, M. Schwartz, and J. Bruck, "Error-correcting codes for rank modulation," Proceedings of the IEEE International Symposium on Information Theory (ISIT), Toronto, Canada, July 2008, pp. 1736-1740.
8. A. Jiang, R. Matescu, M. Schwartz, and J. Bruck, "Rank modulation for flash memories," Proceedings of the IEEE International Symposium on Information Theory (ISIT), Toronto, Canada, July 2008, pp. 1731-1735.
9. D. E. Knuth, The Art of Computer Programming, Volume 3: Sorting and Searching, Reading. MA: Addison-Wesley, 1973.
10. G. Louchard and H. Prodinger, "The number of inversions in permutations: A saddle point approach," Journal of Integer Sequences, vol. 6, 2003, Article 03.2.8 (electronic).
11. B.H. Margolius, "Permutations with inversions," Journal of Integer Sequences, vol. 4, no. 2, 2001, Article 01.2.4, 13 pp. (electronic).
12. R. R. Varshamov and G. M. Tenenholtz, "A code for correcting a single asymmetric error," Automat. Telemekh., vol. 26, no. 2, pp. 288-292, 1965.