A Code Whose Codeword Length is Shorter than log^*_2 n in Almost All of Sufficiently Large Positive Integers(Information Theory)

スポンサーリンク

概要

• 論文の詳細を見る

• A recursive-type positive integer code is proposed. It prefixes the information about the length of the component of the codeword recursively. It is an asymptotically optimal code. The codeword length for a positive integer n is shorter than log^*_2 n bits in almost all of sufficiently large positive integers, where log^*_2 n is the log-star function.

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

著者

• Murashima Sadayuki

  Dept. Of Information And Computer Science Faculty Of Engineering Kagoshima University

• NAKAMURA Hirofumi

  Dept. of Mechanical Engineering (Computer Center), Miyakonojo National College of Technology

• Nakamura Hirofumi

  Dept. Of Mechanical Engineering (computer Center) Miyakonojo National College Of Technology

• Nakamura Hirofumi

  Dept. Of Electrical Engineering(computer Center) Miyakonojo National College Of Technology

関連論文

• A Code Whose Codeword Length is Shorter than log^*_2 n in Almost All of Sufficiently Large Positive Integers(Information Theory)
• On the Codeword Length of Positive Integer Coding

スポンサーリンク