Universal Coding of Positive Integers with Suppressed Codeword Length Order
Grant-in-Aid for Scientific Research (C)
|Allocation Type||Single-year Grants |
|Research Institution||Miyakonojo National College of Technology |
NAKAMURA Hirofumi Miyakonojo National College of Technology, Department of Mechanical Engineering, Associate Professor, 機械工学科, 助教授 (40189056)
|Project Period (FY)
2001 – 2004
Completed (Fiscal Year 2004)
|Budget Amount *help
¥2,400,000 (Direct Cost: ¥2,400,000)
Fiscal Year 2004: ¥400,000 (Direct Cost: ¥400,000)
Fiscal Year 2003: ¥500,000 (Direct Cost: ¥500,000)
Fiscal Year 2002: ¥700,000 (Direct Cost: ¥700,000)
Fiscal Year 2001: ¥800,000 (Direct Cost: ¥800,000)
|Keywords||Positive Integer Code / Universal Code / Codeword Length / Modified Log-star Function / Grouping Strategy / Fractal Image Representation / Numerical Calculation / 正整数符号化 / 対数スター関数 / 理論的限界 / 可逆フラクタル表現 / 可逆フラクタル圧縮 / ユニバーサル符号化 / 等比数列|
This academic activity for four years was done on the universal coding of positive integers, as it is the coding which can effectively encode unbounded positive integers for any appearance probabilities. The results of this study can be summarized as follows :
1.On the study of the universal coding which has good performance for relatively small positive integers
(1)We proposed a code which groups the length of given positive integer with the geometric progression. It is asymptotically optimal. And it has the property of preserving length order, number order, and lexicographic order.
(2)We proposed a code which groups the parameters of Affine Transformation for the fractal representation of images with the grouping strategy of positive integer coding. We show that the reversible fractal representation for images is possible.
2.On the study of the universal coding which length is near known theoretically minimum length order
(1)We proposed a code which uses numerical calculations for the assignment of the codewords. It enables that the order of the codeword length is the modified log-star function for the first time. For positive integer n, its time complexity for coding and decoding is both log n which is the theoretically minimum order.
(2)We proposed a code whose each codeword component is different from Levenshtein-Elias code with one bit at most, where Levenshtein-Elias code is the most basic recursive-type positive integer code. The codeword length of the proposed code is shorter than log-star function in almost all of sufficiently large positive integers.
Report (5 results)
Research Products (16 results)