| Project/Area Number |
24656240
|
|---|
| Research Category |
Grant-in-Aid for Challenging Exploratory Research
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Communication/Network engineering
|
|---|
| Research Institution | The University of Tokyo |
|---|
Principal Investigator |
|
|---|
| Research Collaborator |
WEI Xiaofeng
TSUCHIHASHI Masato
HONDA Junya
|
|---|
| Project Period (FY) |
2012-04-01 – 2015-03-31
|
| Project Status |
Completed (Fiscal Year 2014)
|
| Budget Amount *help |
¥3,900,000 (Direct Cost: ¥3,000,000、Indirect Cost: ¥900,000)
Fiscal Year 2013: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
Fiscal Year 2012: ¥1,950,000 (Direct Cost: ¥1,500,000、Indirect Cost: ¥450,000)
|
|---|
| Keywords | データ圧縮 / 情報源符号化 / FV符号 / ハフマン符号 / 準瞬時符号 / 情報理論 / 準瞬時FV符号 / 固定長-可変長符号 |
|---|
| Outline of Final Research Achievements |
It is known by the McMillan theorem that in the class of uniquely decodable codes, the Huffman code is the optimal FV code that attains the minimum average code length. But, the MacMillan theorem assumed implicitly that only a fixed code tree is used.
In this research, we proposed the almost instantaneous FV (AIFV) codes which use multiple code trees and source symbols are assigned to incomplete internal nodes in addition to leaves. We showed that the AIFV code can attain shorter average code length than the Huffman code. Furthermore, we also showed for binary or ternary sources that the optimal AIFV code can be constructed by using the integer programming and an iterative optimization.
|
