Rank modulation for translocation error correction

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2012, Pages 2988-2992

  Farnoud, Farzad ^a   Skachek, Vitaly ^b   Milenkovic, Olgica ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENT TRANSPOSITION; COMBINATORICS; CONSTRUCTION TECHNIQUE; DECODING ALGORITHM; GOOD CODE; MODULATION CODES; MODULATION CODING; NATURAL EXTENSION; STORAGE SYSTEMS;

ERROR CORRECTION; FLASH MEMORY; INFORMATION THEORY;

MODULATION;

EID: 84867512119     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2012.6284108     Document Type: Conference Paper

References (15)

1. J. Karlof, "Permutation codes for the gaussian channel," Information Theory, IEEE Transactions on, vol. 35, pp. 726-732, July 1989.
2. I. F. Blake, G. Cohen, and M. Deza, "Coding with permutations," Information and Control, vol. 43, no. 1, pp. 1-19, 1979.
3. A. Jiang, M. Schwartz, and J. Bruck, "Error-correcting codes for rank modulation," in Proc. IEEE Int. Symp. Information Theory, (Toronto, Canada), pp. 1736-1740, July 2008.
4. H. Chadwick and L. Kurz, "Rank permutation group codes based on kendall's correlation statistic," IEEE Trans. Information Theory, vol. 15, pp. 306-315, Mar. 1969.
5. P. Diaconis, "Group representations in probability and statistics," Lecture Notes-Monograph Series, vol. 11, 1988.
6. A. Jiang, M. Schwartz, and J. Bruck, "Correcting charge-constrained errors in the rank-modulation scheme," Information Theory, IEEE Transactions on, vol. 56, pp. 2112-2120, May 2010.
7. Z. Wang and J. Bruck, "Partial rank modulation for flash memories," in IEEE International Symposium on Information Theory, pp. 864-868, June 2010.
8. A. Barg and A. Mazumdar, "Codes in permutations and error correction for rank modulation," IEEE Trans. Information Theory, vol. 56, pp. 3158-3165, July 2010.
9. J.-C. Chang, R.-J. Chen, T. Klove, and S.-C. Tsai, "On the maximum number of permutations with given maximal or minimal distance," Information Theory, IEEE Transactions on, vol. 49(4), pp. 1054-1059, 2003.
10. V. I. Levenshtein, "On perfect codes in deletion and insertion metric," Discrete Math. Appl., vol. 2, no. 3, pp. 241-258, 1992.
11. A. Mazumdar, A. Barg, and G. Zemor, "Parameters of rank modulation codes: Examples," in 49th Annual Allerton Conference on Communication, Control, and Computing, pp. 13-17, Sept. 2011.
12. F. Farnoud, V. Skachek, and O. Milenkovic, "Rank modulation for translocation error correction," Arxiv preprint arXiv:1202.0932, 2012.
13. P. Beame, E. Blais, and D. Huynh-Ngoc, "Longest common subsequences in sets of permutations," Arxiv preprint arXiv:0904.1615, 2009.
14. T. Swart and H. Ferreira, "Decoding distance-preserving permutation codes for power-line communications," in AFRICON, pp. 1-7, Sept. 2007.
15. T. Wadayama and M. Hagiwara, "Lp decodable permutation codes based on linearly constrained permutation matrices," in IEEE International Symposium on Information Theory, pp. 139-143, July/Aug. 2011.