Properties of a Word-Valued Source with a Non-prefix-free Word Set

  • Authors:

  • Takashi Ishida;Masayuki Goto;Toshiyasu Matsushima;Shigeichi Hirasawa

  • Affiliations:

  • The authors are with the Department of the Industrial and Management Systems Engineering, School of Science and Engineering, Waseda University, Tokyo, 169-8555 Japan. E-mail: ishida@hirasa.mgmt.wa ...;The author is with the Faculty of Environmental and Information Studies, Musashi Institute of Technology, Yokohama-shi, 224-0015 Japan.;The authors are with the Department of the Industrial and Management Systems Engineering, School of Science and Engineering, Waseda University, Tokyo, 169-8555 Japan. E-mail: ishida@hirasa.mgmt.wa ...;The authors are with the Department of the Industrial and Management Systems Engineering, School of Science and Engineering, Waseda University, Tokyo, 169-8555 Japan. E-mail: ishida@hirasa.mgmt.wa ...

  • Venue:
  • IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
  • Year:
  • 2006

Quantified Score

Hi-index 0.06

Visualization

Abstract

Recently, a word-valued source has been proposed as a new class of information source models. A word-valued source is regarded as a source with a probability distribution over a word set. Although a word-valued source is a nonstationary source in general, it has been proved that an entropy rate of the source exists and the Asymptotic Equipartition Property (AEP) holds when the word set of the source is prefix-free. However, when the word set is not prefix-free (non-prefix-free), only an upper bound on the entropy density rate for an i.i.d. word-valued source has been derived so far. In this paper, we newly derive a lower bound on the entropy density rate for an i.i.d. word-valued source with a finite non-prefix-free word set. Then some numerical examples are given in order to investigate the behavior of the bounds.