Balanced Permutation Codes
classification
💻 cs.IT
math.IT
keywords
balancedpermutationcapacitycodesapproachbalancingchargecode
read the original 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
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.