A Consideration on Conditions of Extended Binary Memoryless Sources where Different Huffman Codes are Constructed -- A Case that Combined Symbols Belong to the Same Group in the First and Second Steps of the Reduction -- | Toshiyasu Matsushima Laboratory

Title	A Consideration on Conditions of Extended Binary Memoryless Sources where Different Huffman Codes are Constructed -- A Case that Combined Symbols Belong to the Same Group in the First and Second Steps of the Reduction -- (in Japanese)
Authors	Nozomi Miya 、Takahiro Yoshida 、Hajime Jinushi
Released Year	2017
Format	Conference
Category	Source coding
Jounal Name	IEICE Tech. Rep.
Jounal Page	vol.117, no.394, IT2017-61, pp.37–42
Published Year	2018
Published Month	1
Abstract （English）	Different Huffman codes, i.e., different codeword sets constructed in Huffman coding are given for $n$-th degree extended binary memoryless sources whose alphabet is ${ 0, 1}^{n}$ if $(n, p)$ varies, where $p geq 1 / 2$ denotes the probability that symbol 0 occurs. In the case that $n > 2$, sufficient conditions w.r.t. $(n, p)$ for constructing $2n - 1$ different Huffman codes and the range where they do or do not coincide with necessary conditions have been presented. In this study, the range is extended and the example is shown in the case that each sum of the two smallest probabilities in the first and second steps of the reduction is in $[P_{k}, P_{k - 1})$, where $P_{k}$ denotes the probability of the source symbol with $k$ symbols of 1.
Note （English）	1
Manuscript
Presentation