A New Asymptotically Optimal Code for the Positive Integers
Hirosuke Yamamoto and Hiroshi Ochi
IEEE Trans. on Information Theory, Vol. 37, No.5, pp.1420-1429, Sep. 1991
- A new universal binary code foe the positive integers is proposed as a modified version of Wang's flag encoding scheme. The codeword length of the new scheme is shorter than Wang's on an average, for large initial segments of the positive integers. The performance of the new scheme is also compared with other universal schemes. Furthermore , it is shown that an asymptotically optimal code can be achieved by modifying the new flag scheme such that the flag length varies dynamically.
- Index Terms: Asymptotically optimal code, universal code, flag encoding
- The above scheme is explained in Section 2.16 "Yamamoto's Flag Code" of the following book:
- David Salomon, "Variable-length Codes for Data Compression", Springer-Verlag, 2007. (ISBN 978-1-84628-958-3)
- DOI: 10.1109/18.133261