Various source coding schemes encode the set of integers using a binary representation of the integers to be encoded, prefixed by some information about the length of that representation. In the context of recency rank encoding, these can be regarded as attempts to assign codewords with lengths close to the logarithm of the integer to be encoded, or as attempts to construct a code for a distribution function Q(*) on the integers, where Q(k)=(1/k)/ Sigma /sub i/(1/i), i in I, and I is a finite set of positive integers to be encoded. It is shown that fixed-prefix encoding is equivalent to Huffman coding for the distribution Q(*).
展开▼
机译：各种源编码方案都使用待编码整数的二进制表示形式对整数集进行编码，并以有关该表示长度的一些信息作为前缀。在新近度等级编码的上下文中，可以将其视为尝试分配长度接近要编码整数的对数的代码字，或尝试为整数构造分布函数Q（*）的代码，其中Q（k）=（1 / k）/ Sigma / sub i /（1 / i），i在I中，而I是要编码的正整数的有限集合。可以看出，固定前缀编码等效于分布Q（*）的霍夫曼编码。
展开▼
