2006年4月
A code whose codeword length is shorter than log*(2) n in almost all of sufficiently large positive integers "jointly worked"
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
- ,
- 巻
- E89A
- 号
- 4
- 開始ページ
- 1132
- 終了ページ
- 1139
- 記述言語
- 英語
- 掲載種別
- 研究論文（学術雑誌）
- DOI
- 10.1093/ietfec/e89-a.4.1132
- 出版者・発行元
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
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 log2(*) n bits in almost all of sufficiently large positive integers, where log(2)* n is the log-star function.
- リンク情報
- ID情報
-
- DOI : 10.1093/ietfec/e89-a.4.1132
- ISSN : 0916-8508
- eISSN : 1745-1337
- Web of Science ID : WOS:000237202400040