Balanced Permutation Codes
Information Theory
2016-01-27 v1 math.IT
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
Keywords
Cite
@article{arxiv.1601.06887,
title = {Balanced Permutation Codes},
author = {Ryan Gabrys and Olgica Milenkovic},
journal= {arXiv preprint arXiv:1601.06887},
year = {2016}
}