A positive integer code by coding multiple length information

A positive integer code F-h,F-m,F-b(h greater than or equal to 3, m greater than or equal to 2, b greater than or equal to 3) is proposed. It codes re cursive length information with two types of code. One codes repeatedly m l ength information each value of which is equal to or more than 2(h-1). The end of codeword is expressed in b bits, The other codes length information each value of which is less than 2(h-1). Th, codeword length of F-h,F-m,F-b (n) is not more than log*n + C(1)w*(n) + C-2, where log* = log(2) n + log(2 ) log n + log(2) log(2) log(2) n+..., w*(n) is the number of zero or positi ve terms of log* n, and C-1, C-2 are constants that depend on It, m, b, C-1 is expressed as -log(2) log(2) e < C-1 < -logloge + 2.0374/2(h) + (log log e - log(1 - 2403 /(404.2(b))))/m less than or equal to - log(2) log(2) e 2.0374/2(h) + 2.4918/m. If C-1 < 0, C-2 is expressed as C-2 <less than> (w *(h - 2) + m + 1)log(2) log(2)e + b + 2.5186, (C) 2001 Scripts Technica