2016/01/26 by Ryan Gabrys, Olgica Milenkovic, Olgica Milenković +2
Computer Science · Engineering · Mathematics · #Advanced Wireless Communication Techniques #Coding theory and cryptography #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.IT #graph theory and CDMA systems #math.IT
paper · pdf · doi:10.48550/arxiv.1601.06887
arxiv created 2016/01/26 · openalex publication_date 2016/01/26 · arxiv updated 2016/01/27 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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