Lossless Data Compression Codes

List of Papers

  1. H.Yamamoto and Ken-ichi Iwata, " Encoding and Decoding Algorithms of ANS Variants and Evaluation of Their Average Code Lengths, " IEICE Trans. on Fundamentals (Japanese Edition), vol.J107-A, no.6, pp.91-101, Nov. 2024 (Advance publication: July 2024) (Invited paper in Japanese).
    (English Translation Version: arXiv.2408.07322)
  2. H.Yamamoto, "AIFV Code to Achieve Better Compression Rate than the Huffman Code ," J. of the IEICE, vol.104, no.1, pp.35-42, Jan. 2021 (survey paper in Japanese)
  3. W.Hu, H.Yamamoto, and J.Honda "Worst-case redundancy of optimal binary AIFV codes and their extended codes," IEEE Trans. on Inform. Theory, vol.63, no.8, pp.5074-5086, Aug. 2017
  4. H.Yamamoto and Y.Kuwaori "Direct- and fast-access decoding schemes for VFcodes," IEICE Trans. on Fundamentals, vol.E99-A, no.12, pp.2291-2295, Dec. 2016
  5. H.Yamamoto, M.Tsuchihashi, and J.Honda "Almost instantaneous fixed-to-variable length codes," IEEE Trans. on Inform. Theory, vol.61 no.12, pp.6432-6443, Dec. 2015
  6. 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
  7. H.Yamamoto, "New algorithms in data comression [I]: The history of lossless data compression algorithms," J. of the IEICE, vol.86, no.2, pp.120-126, Feb 2003 (in Japanese)
  8. H.Yamamoto and H.Yokoo, "Average-sense optimality and competitive optimality for almost instantaneous VF codes," IEEE Trans. on Inform. Theory, vol.47, no.6, pp.2174-2184, Sep. 2001
  9. H.Yamamoto, "A new recursive universal code of the positive integers", IEEE Trans. on Inform. Theory, vol.46, no.2, pp.717-723, March 2000
  10. 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
  11. 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
  12. H.Yamamoto and T.Itoh, "Competitive optimality of source codes", IEEE Trans. on Inform. Theory, vol.41, no.6, pp.2015-2019, Nov. 1995
  13. 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)
  14. 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)
  15. T.Amemiya and H.Yamamoto, "A new class of the universal representation for the positive integers", IEICE Trans. on Fundamentals, vol.E76-A, no.3, pp.447-452, March 1993
  16. 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
  17. H.Yamamoto and H.Ochi, "A new asymptotically optimal code for the positive integers", IEEE Trans. on Inform. Theory, vol.37, no.5, pp.1420-1429, Sep. 1991

ページのトップへ