Balanced Permutation Codes

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