Balanced Permutation Codes

Research paper by Ryan Gabrys, Olgica Milenkovic

Indexed on: 25 Jan '16Published on: 25 Jan '16Published in: Computer Science - Information Theory


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