- [Home]
- [Research achievement]
- [Research achievement detail]
Title | A Consideration on Classification of Extended Binary Memoryless Sources where Different Huffman Codes are Constructed (in Japanese) |
---|---|
Authors | Takahiro YOSHIDA 、Hajime JINUSHI |
Released Year | 2014 |
Format | Journal |
Category | Source coding |
Jounal Name | |
Jounal Page | vol.J98-A, no.3, pp.284-295 |
Published Year | 2015 |
Published Month | 3 |
Abstract (English) |
We consider characteristics of Huffman codes for extended binary memoryless sources. The construction of Huffman codes consists of two parts. In the first part, a reduced source is created by sorting the source symbols in decreasing order of its probability, combining the two least probable source symbols into a single symbol, and re-sorting the new set in decreasing order. By repeating this process until there is two symbols remaining, a series of reduced sources is created. In the second part, a code tree is generated from the series of reduced sources created in the first part. Therefore the Huffman code is designed uniquely from a sequence of position of the combined symbol in each reduced source. In this study, we consider characteristics of this sequence for binary memoryless sources, and present conditions of binary memoryless sources that a different Huffman code is designed. |
Note (English) |
3 |
Manuscript | |
Presentation |
Involved Papers
- A Note on Mixed Level Experimental Designs Using Augmented Orthogonal Arrays (in Japanese)
- 半教師付き学習における一致性を満たすゆう度方程式の解に基づく予測の漸近評価
- A CLASS OF NOISELESS CODES DESIGNED BY DECISION THEORY
- 相互情報量最大に基準を置くユーザインタフェースの効率化
- パターンごと・ステージごとに事後確率のしきい値をおくストッピングルール
- Inductive Inference and Description Length (in Japanese)
- 信頼性を考慮した推論について
- On Knowledge Representation and Reasoning System with a Range of Certainty Factors (in Japanese)
- 特集にあたって
- On Statistical Model Selection based on Bayes Decision Theory (in Japanese)
- On Complexity of Decoding beyond the BCH Bound Using Berlekamp-Massey Algorithm (in Japanese)
- On Decoding Methods beyond the BCH Bound and their Applications to Soft-Decision Decoding (in Japanese)
- Soft-Decision Decoding Using Decoding Method beyond the BCH Bound for Binary BCH Codes (in Japanese)
- A Study on Difference of Codelengths between Codes Based on MDL Principle and Bayes Codes for Given Prior Distributions (in Japanese)
- A Decision Feedback Scheme Using List Decoding for Tree Codes (in Japanese)
- Asymptotic Normality of Extended Posterior Density Functions with Loss Functions (in Japanese)
- A New Decoding Algorithm Using Likelihood Ratio Testing for Tree Codes (in Japanese)
- On Error Exponents for Variable Size List Decoder Using the Viterbi Algorithm with Likelihood Ratio Testing (in Japanese)
- On the Interleaver Design Method for Block Turbo Codes and Its Minimum Distance (in Japanese)
- あいまいな命題を含む推論モデルに関する一考察