@inproceedings{9f6bd936d8b945b4833560ec31e10651,
title = "Balanced permutation codes",
abstract = "Motivated by charge balancing constraints for rank modulation schemes, we introduce the notion of balanced permutations and derive the capacity of balanced permutation codes. We also describe simple interleaving methods for permutation code constructions and show that they approach capacity.",
author = "Ryan Gabrys and Olgica Milenkovic",
note = "Funding Information: This work was funded in part by the NSF grants CCF 11-17980, 1526875, 1527636 Publisher Copyright: {\textcopyright} 2016 IEEE. Copyright: Copyright 2017 Elsevier B.V., All rights reserved.; 2016 IEEE International Symposium on Information Theory, ISIT 2016 ; Conference date: 10-07-2016 Through 15-07-2016",
year = "2016",
month = aug,
day = "10",
doi = "10.1109/ISIT.2016.7541327",
language = "English (US)",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "390--394",
booktitle = "Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory",
address = "United States",
}