arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2501.11129cs.ITcs.DSmath.IT
收藏

具有每个码字最多D个1的最优二进制可变长度码:设计、分析与应用

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

Department of Computer Science, University of Salerno(萨莱诺大学计算机系)

Roberto Bruno, Roberto De Prisco, Ugo Vaccaro

AI总结:

本文提出了一种在每个码字最多包含D个1的约束下构造最优二进制可变长度码的算法,并探讨了其应用场景及存在性条件。

摘要:

在本文中,我们考虑在每个码字最多包含D个1的约束下构造最优平均长度二进制码的问题。我们提供了一个时间复杂度为O(n²D)的算法来构造此类码,其中n是码字的数量。我们还描述了几种自然出现需要设计此类码的场景。我们还提供了一个类似Kraft不等式的不等式,用于在上述约束条件下确定(最优)可变长度二进制码的存在性。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑