2025/01/19 by Roberto Bruno, Bruno, Roberto, Roberto De Prisco +3
Computer Science · Engineering · #Advanced Wireless Communication Techniques #Coding theory and cryptography #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2501.11129
openalex publication_date 2025/01/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we consider the problem of constructing optimal average-length binary codes under the constraint that each codeword must contain at most D ones, where D is a given input parameter. We provide an O(n2D)-time complexity algorithm for the construction of such codes, where n is the number of codewords. We also describe several scenarios where the need to design these kinds of codes naturally arises. We also provide a Kraft-like inequality for the existence of (optimal) variable-length binary codes, subject to the above-described constraint on the number of 1's in each codeword.