On universality of both Bayes codes and Ziv-Lempel codes for sources which emit data sequence by block unit

Takashi Ishida, Masayuki Gotoh, Shigeichi Hirasawa

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Ziv-Lempel (ZL) codes and Bayes codes are typical universal codes. An improved algorithm of the ZL code is widely used in compression software. On the other hand, practical use of Bayes codes is difficult due to the large amount of computation needed. However, a realizable algorithm in terms of computation effort has been constructed for the FSMX model group [9]. In this paper, an information source generating a sequence by word units is assumed as a model that can represent the probabilistic structure of actual data such as text data. The asymptotic compression performance of both codes is analyzed and evaluated for the information source class (information source for the block unit) with a constant (fixed) word length. As a result, it is found that Bayes code cannot directly be universal as a coding algorithm for symbol units. On the other hand, the ZL78 code can be directly universal. Also, a configuration method for the Bayes coding method is given for an information source with a block unit.

Original languageEnglish
Pages (from-to)58-69
Number of pages12
JournalElectronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)
Volume86
Issue number1
DOIs
Publication statusPublished - 2003 Jan 1

Keywords

  • Bayes code
  • Information source with a word unit
  • Universal code
  • Ziv-Lempel code

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this