Optimal Binary Variable-Length Codes with a Bounded Number of 1's per Codeword: Design, Analysis, and Applications

TL;DR

This paper introduces an efficient algorithm for designing optimal binary variable-length codes with a maximum number of ones per codeword, providing theoretical bounds and practical applications for constrained coding scenarios.

Contribution

It presents a novel $O(n^2D)$-time algorithm for constructing optimal codes with bounded ones, along with a Kraft-like inequality for existence conditions.

Findings

Developed an $O(n^2D)$ algorithm for code construction

Derived a Kraft-like inequality for constrained codes

Identified practical scenarios requiring such codes

Abstract

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(n^2D)$-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.