课题基金 / 基金详情

Universal Coding of Positive Integers with Suppressed Codeword Length Order

Universal Coding of Positive Integers with Suppressed Codeword Length Order
具有抑制码字长度顺序的正整数通用编码
批准号:
13650441
负责人:
NAKAMURA Hirofumi
金额:
$1.54万
依托单位国家:
日本
项目类别:
Grant-in-Aid for Scientific Research (C)
财政年份:
2001
资助国家:
日本
项目状态:
已结题
起止时间:
2001 至 2004

项目摘要

项目成果

NAKAMURA Hirofumi的其他基金

相似基金

相关文献

中文摘要
翻译
这个为期四年的学术活动是关于正整数的通用编码,因为它是可以对任意出现概率的无界正整数进行有效编码的编码。本研究的结果可以总结为:1。在研究对较小正整数具有良好性能的通用编码的基础上(1)提出了一种将给定正整数的长度按几何级数分组的编码。它是渐近最优的。它具有保持长度顺序、数字顺序和字典顺序的特性。(2)采用正整数编码的分组策略,对图像分形表示的仿射变换参数进行分组。我们证明了图像的可逆分形表示是可能的。在研究长度接近已知最小长度阶的通用编码的基础上(1)提出了一种用数值计算方法分配码字的编码。首次启用码字长度顺序为修改后的log-star函数。对于正整数n,其编码和解码的时间复杂度均为log n,这是理论上的最小阶数。(2)提出了一种码字分量与Levenshtein-Elias码最多相差1位的码,其中Levenshtein-Elias码是最基本的递归型正整数码。在几乎所有足够大的正整数中,所提出的码字长度都短于对数星函数。
英文摘要
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.
期刊论文(16)
专著(0)
科研奖励(0)
会议论文
A Code Whose Codeword Length is Shorter than log^* n in Almost All of Sufficiently Large Positive Integers
几乎所有足够大的正整数中码字长度都小于 log^* n 的代码
DOI: --
发表时间: 2006
期刊: The Transactions on Fundamentals of Electronics, Communications and Computer Sciences of The Institute of Electronics, Information and Communication Engineers (in print)
影响因子: --
作者: [Akuzawa Toshinao, Noboru Murata, Hirofumi NAKAMURA]
通讯作者: Hirofumi NAKAMURA
中村博文, 村島定行: "長さ情報の定数回拡張に基づいた正整数符号"電子情報通信学会技術報告情報理論. 103・710. 13-18 (2004)
Hirofumi Nakamura、Sadayuki Murashima:“基于长度信息不断扩展的正整数代码”IEICE 技术报告信息理论 103・710 (2004)。
DOI: --
发表时间:
期刊:
影响因子: --
作者: []
通讯作者:
DOI: --
发表时间:
期刊:
影响因子: --
作者: []
通讯作者:
長さ情報の定数回拡張を用いた正整数符号
长度信息不断扩展的正整数代码
DOI: --
发表时间: 2005
期刊: 電子情報通信学会論文誌A J88-A,11
影响因子: --
作者: [中村博文]
通讯作者: 中村博文
共 15 条
    Tritium behavior at the interface of oxidized metal under high temperature water
    • 批准号:
      21560875
    • 项目类别:
      Grant-in-Aid for Scientific Research (C)
    • 资助金额:
      $2.83万
    • 财政年份:
      2009
    • 负责人:
      NAKAMURA Hirofumi
    • 依托单位:
    Codeword assignments to theoretical codeword length functions on the universal integer coding
    • 批准号:
      18560396
    • 项目类别:
      Grant-in-Aid for Scientific Research (C)
    • 资助金额:
      $1.91万
    • 财政年份:
      2006
    • 负责人:
      NAKAMURA Hirofumi
    • 依托单位:
    海外基金