唯一可译码加细序集上作为单调函数的Kraft和
The Kraft sum as a monotone function on the refinement-ordered set of uniquely decipherable codes
摘要:
所有唯一可破译(UD)代码的集合部分地通过细化来排序,这意味着粗代码中的所有字符串都可以表示为从细代码中提取的字符串的串联。Kraft和是这个偏序集上的单调(递增)函数。在细化顺序中,具有相同Kraft和的UD码的链必然是简单序列类型。UD码的一个特征在于涉及Kraft和的等式。
英文摘要:
The set of all uniquely decipherable (UD) codes is partially ordered by refinement, meaning that all strings in the cruder code can be represented as concatenations of strings taken from the finer code. The Kraft sum is a monotone (increasing) function on this poset. In the refinement order, chains of UD codes having the same Kraft sum are necessarily of the simple sequence type. A characterization of UD codes in terms of equalities involving Kraft sums is also given.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。