Research on the structure of compact codes for binary memoryless extended sources

本研究的目的是解决二进制无内存扩展源的紧凑代码后面的问题：（1）找到n的一般形式，并找到满足条件下的二进制无内存扩展源的扩展顺序：其中n是扩展顺序， k = “n/2”-1，t是任何正整数。（2）找到一种系统方法来确定二进制内存扩展源的两个紧凑代码的复杂性。研究的结果如下：（1）根据在下面的网页上发表的方法，我们提供了在n = 2、3和6的情况下，在n = 2、3和6的情况下，二进制协同增效作用是只有两个人的力量。http：//web2.incl.ne.jp/yaok/nikouks.htm·http：//web2.incl.ne.jp/yaoki/anikouks.htm（2） A binomial source is obtained by the extension of a binary memory less source and its properties are determined by the extension order and the superior symbol's probability p. As for the enumerating all Huffman codes for a binomial source， we have proposed a code tree modification method based by Longo and Galasso。此外，我们还对Huffman代码进行了基于一些数字实验的二元来源的调查。在对这些赫夫曼代码进行枚举以作为特定顺序源的二元来源时，我们提出了一个索引序列的概念，该概念是在赫夫曼程序中指定的减少源序列。我们的数字实验已经揭示了2至11号订单的指数序列和代码长度的二元来源。The Experiments Show a Couple of Characteristics in the index sequences不符合订单的结果。

The purpose of this research is to solve the following problems for the compact codes for binary memoryless extended sources :(1) To find out the general form of n, the extension order for a binary memoryless extended source that satisfies the following condition :where n is an extension order, k = 「n/2」-1 and t is any positive integer.(2) To find out the systematic method to determine the adjacency of two compact codes for a binary memoryless extended source.The results of the research are as follows :(1) According to the method published on the following Web pages, we proved that the binomial coefficient mentioned above is the power of two only in the case that n = 2, 3 and 6.・http://web2.incl.ne.jp/yaok/nikouks.htm・http://web2.incl.ne.jp/yaoki/anikouks.htm(2) A binomial source is obtained by the extension of a binary memoryless source and its properties are determined by the extension order and the superior symbol's probability p. As for the enumerating all Huffman codes for a binomial source, we have proposed a code tree modification method based the one proposed by Longo and Galasso. Also we have investigated Huffman codes for binomial sources based on some numerical experiments. In order to enumerate these Huffman codes for a binomial source of the certain order, we have introduced the concept of index sequence that specifies the sequence of reduced sources in the Huffman's procedure. Our numerical experiments have revealed the index sequences and code length sets for binomial sources of the order from 2 to 11. The results of the experiments show a couple of characteristics in the index sequences irrespective of the orders.