A positive integer code by coding multiple length information
Hirofumi Nakamura, Sadayuki Murashima · Electronics and Communications in Japan (Part III Fundamental Electronic Science) · 2001
Abstract A positive integer code Fh,m,b(h⩾3,m⩾2,b⩾3) is proposed. It codes recursive length information with two types of code. One codes repeatedly m length information each value of which is equal to or more than 2h&minus1. The end of codeword is expressed in b bits. The other codes length information each value of which is less than 2h&minus1. The codeword length of Fh,m,b(n) is not more than log*n+C1w*(n)+C2, where log*=log2n+log2log2n+log2log2log2n+ ⃛, w*(n) is the number of zero or positive terms of log*n, and C1,C2 are constants that depend on h, m, b. C1 is expressed as −log2log2e<C1<−logloge+2.0374/2h+(logloge−log(1−2403/(404ċ2b)))/m⩽ −log2 log2e+2.0374/2h+2.4918/m. If C1 < 0, C2 is expressed as C2 < (w*(h−2)+m+ 1)log2log2e+b+2.5186. © 2001 Scripta Technica, Electron Comm Jpn Pt 3, 84(8): 46–56, 2001