A Code for Positive Integers with Grouping of Message Length Using Geometric Progression

スポンサーリンク

概要

• 論文の詳細を見る

• A positive integer code EX'E_<b, h, d>(b ≥ 1, h ≥1, d ≥ 0) is proposed. Its codeword for a positive integer n consists of three kinds of information: (1) how many times the number of n's digits can be subtracted by the terms of a progression including a geometric progression, (2) the rest of the subtractions, and (3) given value of the positive integer n. EX'E_<b, h, d> is a non-recursive type code. It is an asymptotically optimal code (for d ≥ 1) and preserves the lexicographic, length, and number orders (for b ≥ h + 2). Some examples of EX'E_<b, h, d> are also presented. Their codeword lengths are found to be shorter than the Amemiya and Yamamoto code CE_k except for small positive integers.

• 社団法人電子情報通信学会の論文
• 2001-09-01

著者

• Murashima Sadayuki

  The Department Of Information And Computer Science Faculty Of Engineering Kagoshima University

• NAKAMURA Hirofumi

  the Department of Mechanical Engineering (Computer Center), Miyakonoji National College of Technolog

関連論文

• A Code for Positive Integers with Grouping of Message Length Using Geometric Progression

スポンサーリンク