Generation of a compact code for extended binary memoryless sources with low entropy

作     者：Hasegawa, M Kato, S Yamada, Y 

作者机构：Utsunomiya Univ Fac Engn Utsunomiya Tochigi 321 Japan 

出 版 物：《ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE》 (Electron Commun Jpn Part III Fundam Electron Sci)

年 卷 期：2000年第83卷第1期

页      面：70-77页

核心收录：

主　　题：compact code Huffman code information source coding memoryless information source expanded information source 

摘      要：A method is proposed for configuring the compact code for extended binary memoryless sources with probabilistic deviations in symbol appearance. In an n-th order extended information source for binary memoryless sources, messages with identical appearance probabilities are generated abundantly. If these messages are grouped for treatment, no rearrangement of the messages encompassing the groups is generated in degenerate operations by the Huffman algorithm for low-entropy information sources where the appearance probability of the superior symbols approaches arbitrarily close to 1. That is the situation is used in this paper. It is reported that the code length and sets of code words, average code length, and maximum code length of the compact code can be derived by a simple equation without forming a code tree. (C) 1999 Scripta Technica.