Balanced Permutation Codes
Ryan Gabrys, Olgica Milenkovic

TL;DR
This paper introduces balanced permutations motivated by charge balancing in rank modulation, derives their capacity, and presents interleaving methods for code construction that approach this capacity.
Contribution
It defines balanced permutations, calculates their capacity, and proposes interleaving construction methods nearing capacity.
Findings
Derived the capacity of balanced permutation codes.
Proposed interleaving methods approach capacity.
Established the relevance to charge balancing in rank modulation.
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
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Advanced Wireless Communication Techniques
