Grammar-based codes: A new class of universal lossless source codes

被引：216
|
作者：
Kieffer, JC [1 ]
Yang, EH
机构：
[1] Univ Minnesota, Dept Elect & Comp Engn, Minneapolis, MN 55455 USA
[2] Univ Waterloo, Dept Elect & Comp Engn, Waterloo, ON N2L 3G1, Canada
来源：
IEEE TRANSACTIONS ON INFORMATION THEORY | 2000年 / 46卷 / 03期
基金：
美国国家科学基金会; 加拿大自然科学与工程研究理事会;
关键词：
Chomsky hierarchy; context-free grammars; entropy; Kolmogorov complexity; lossless coding; redundancy; universal coding;
D O I：
10.1109/18.841160
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We investigate a type of lossless source code called a grammar-based code, which, in response to any input data string a: over a fixed finite alphabet, selects a contest-free grammar G(x) representing x in the sense that x is the unique string belonging to the language generated by G(x), Lossless compression of a: takes place indirectly,ia compression of the production rules of the grammar G(x), It is shown that, subject to some mild restrictions, a grammar-based code is a universal code with respect to the family of finite-state information sources over the finite alphabet. Redundancy bounds for grammar-based codes are established. Reduction rules for designing grammar-based codes are presented.
引用
收藏
页码：737 / 754
页数：18
相关论文
共 50 条
  • [1] Grammar-based lossless universal refinement source coding
    Kieffer, JC
    Yang, EH
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (07) : 1415 - 1424
  • [2] Application of grammar-based codes for lossless compression of digital mammograms
    Li, Xiaoli
    Krishnan, Sridhar
    Ma, Ngok-Wah
    [J]. JOURNAL OF ELECTRONIC IMAGING, 2006, 15 (01)
  • [3] On vocabulary size of grammar-based codes
    Debowski, Lukasz
    [J]. 2007 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS, VOLS 1-7, 2007, : 91 - +
  • [4] The compression performance of grammar-based codes revisited
    He, DK
    Yang, EH
    [J]. ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 290 - 290
  • [5] Performance analysis of grammar-based codes revisited
    He, DK
    Yang, EH
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (07) : 1524 - 1535
  • [6] A Universal Grammar-Based Code for Lossless Compression of Binary Trees
    Zhang, Jie L.
    Yang, En-Hui
    Kieffer, John C.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (03) : 1373 - 1386
  • [7] On the Vocabulary of Grammar-Based Codes and the Logical Consistency of Texts
    Debowski, Lukasz
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (07) : 4589 - 4599
  • [8] On the universality of grammar-based codes for sources with countably infinite alphabets
    He, DK
    Yang, EH
    [J]. 2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 50 - 50
  • [9] The universality of grammar-based codes for sources with countably infinite alphabets
    He, DK
    Yang, EH
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (11) : 3753 - 3765
  • [10] Prediction and Evaluation of Zero Order Entropy Changes in Grammar-Based Codes
    Vasinek, Michal
    Platos, Jan
    [J]. ENTROPY, 2017, 19 (05)
12345