@inproceedings{887fb01a71a8464e8b32671286adc20e,
title = "Error-correcting codes for multipermutations",
abstract = "Multipermutations appear in various applications in information theory. New applications such as rank modulation for flash memories and voting have suggested the need to consider error-correcting codes for multipermutations. The construction of codes is challenging when permutations are considered and it becomes even a harder problem for multipermutations. In this paper we discuss the general problem of error-correcting codes for multipermutations. We present some tight bounds on the size of error-correcting codes for several families of multipermutations. We find the capacity of the channels of multipermutations and characterize families of perfect codes in this metric which we believe are the only such perfect codes.",
author = "Sarit Buzaglo and Eitan Yaakobi and Tuvi Etzion and Jehoshua Bruck",
year = "2013",
doi = "https://doi.org/10.1109/ISIT.2013.6620321",
language = "الإنجليزيّة",
isbn = "9781479904464",
series = "IEEE International Symposium on Information Theory - Proceedings",
pages = "724--728",
booktitle = "2013 IEEE International Symposium on Information Theory, ISIT 2013",
note = "2013 IEEE International Symposium on Information Theory, ISIT 2013 ; Conference date: 07-07-2013 Through 12-07-2013",
}