Generation of a compact code for extended binary memoryless sources with low entropy
Madoka Hasegawa, Shigeo Kato, Yoshifumi Yamada · Electronics and Communications in Japan (Part III Fundamental Electronic Science) · 2000
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 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. © 1999 Scripta Technica, Electron Comm Jpn Pt 3, 83(1): 70–77, 2000