Department of Complexity Science and Engineering, Graduate School of Frontier Sciences, The University of Tokyo

List of Papers

1. M. Arimura and H.Yamamoto, "Asymptotic redundancy of the MTF scheme for stationary ergodic sources," IEEE Trans. on Inform. Theory, vol.51, no.11, pp.3742-3752, Nov. 2005
2. M.Arimura and H.Yamamoto, "The asymptotic optimality of the block sorting data compression algorithm", IEICE Trans. on Fundamentals, vol.E81-A, no.10, pp.2117-2122, Oct. 1998
3. M.Arimura, H.Yamamoto, and S.Arimoto, "A bit tree weighting method for lossless compression of gray scale images" IEICE Trans. on Fundamentals, vol.E80-A, no.11, pp.2268-2271, Nov. 1997
4. M.Ohmine and H.Yamamoto, "Universal data compression algorithms with multilple dictionaries"， IEICE Trans., vol.J77-A, no.8, pp.1178-1181, Aug. 1994 (in Japanese)
5. H.Yamamoto, "Universal Data Compression Algorithms Principles and Techniques", J. of Institute of Inform. Processing of JAPAN, vol.35, no.7, pp.600-608, July 1994 (in Japanese)
6. T.Kawabata and H.Yamamoto "A new implementation of the Ziv-Lempel incremental parsing algorithm", IEEE Trans. on Inform. Theory, vol.37, no.5, pp.1439-1440, Sep. 1991