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

Takashi Ishida, Masayuki Goto, 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

    Keywords

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

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering

    Cite this

    @article{4addb1dadd01454aa6e64856b1d3ec97,
    title = "On universality of both Bayes codes and Ziv-Lempel codes for sources which emit data sequence by block unit",
    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.",
    keywords = "Bayes code, Information source with a word unit, Universal code, Ziv-Lempel code",
    author = "Takashi Ishida and Masayuki Goto and Shigeichi Hirasawa",
    year = "2003",
    doi = "10.1002/ecjc.10017",
    language = "English",
    volume = "86",
    pages = "58--69",
    journal = "Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)",
    issn = "1042-0967",
    publisher = "John Wiley and Sons Inc.",
    number = "1",

    }

    TY - JOUR

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

    AU - Ishida, Takashi

    AU - Goto, Masayuki

    AU - Hirasawa, Shigeichi

    PY - 2003

    Y1 - 2003

    N2 - 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.

    AB - 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.

    KW - Bayes code

    KW - Information source with a word unit

    KW - Universal code

    KW - Ziv-Lempel code

    UR - http://www.scopus.com/inward/record.url?scp=0037210036&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0037210036&partnerID=8YFLogxK

    U2 - 10.1002/ecjc.10017

    DO - 10.1002/ecjc.10017

    M3 - Article

    AN - SCOPUS:0037210036

    VL - 86

    SP - 58

    EP - 69

    JO - Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)

    JF - Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)

    SN - 1042-0967

    IS - 1

    ER -