Codeword assignments to theoretical codeword length functions on the universal integer coding

当信息的基本符号数不受限制时，信息的编码达到正整数编码。正整数编码所需的0和1的数量可以表示为正整数的函数，即码字长度函数。特别是对于低阶码字长度函数，目前还没有复杂度小的码字分配算法。对于两个码字长度函数，我们提出了码字分配算法。每个码的时间复杂度的数量级与其码字长度一样小。

When the number of elemental symbols of information is unlimited, the coding of the information arrive at positive integer coding. The number of necessary 0 and 1 for positive integer coding can be expressed as a function of the positive integer, that is codeword length function. Especially, for small order codeword length functions, there exist no codeword assignment algorithm with small complexity. For two codeword length functions, we proposed codeword assignment algorithms. The order of the time complexity of each code is as small as its codeword length.