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 条
  • [41] NEW CLASS OF BINARY CODES CONSTRUCTED ON BASIS OF BCH CODES
    KASAHARA, M
    SUGIYAMA, Y
    HIRASAWA, S
    NAMEKAWA, T
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (05) : 582 - 585
  • [42] New class of double inductive binary error correcting codes based on the class of Reed-Muller codes
    Kabilafkas, D.
    Turner, L.F.
    [J]. IEE proceedings. Part F. Communications, radar and signal processing, 1988, 135 -F (06): : 507 - 512
  • [43] NEW CLASS OF DOUBLE INDUCTIVE BINARY ERROR CORRECTING CODES BASED ON THE CLASS OF REED-MULLER CODES
    KABILAFKAS, D
    TURNER, LF
    [J]. IEE PROCEEDINGS-F RADAR AND SIGNAL PROCESSING, 1988, 135 (06) : 507 - 512
  • [44] A New Class of MDS Erasure Codes Based on Graphs
    Puttarak, Nattakan
    Kaewprapha, Phisan
    Chong, Ng Boon
    Li , Jing
    [J]. GLOBECOM 2009 - 2009 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-8, 2009, : 6598 - +
  • [45] Universal variable-to-fixed length source codes
    Visweswariah, K
    Kulkarni, SR
    Verdú, S
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (04) : 1461 - 1472
  • [46] Low complexity code design for lossless and near-lossless side information source codes
    Zhao, Q
    Effros, M
    [J]. DCC 2003: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2003, : 3 - 12
  • [47] NEW CLASS OF DOUBLE INDUCTIVE ERROR CORRECTING CODES BASED ON THE CLASS OF GRM AND DGRM CODES OVER GF(2)
    Thakran, Seema
    Tyagi, Vinod
    [J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2014, 6 (01)
  • [48] String matching-based universal source codes for source networks with asymptotically zero feedback
    Yang, EH
    He, DK
    Uyematsu, T
    Yeung, RW
    [J]. 2005 IEEE International Symposium on Information Theory (ISIT), Vols 1 and 2, 2005, : 2349 - 2353
  • [49] Hermitian Symmetric DFT Codes: A New Class of Complex DFT Codes
    Kumar, A. Anil
    Makur, Anamitra
    [J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (05) : 2396 - 2407
  • [50] Braided Convolutional Codes: A New Class of Turbo-Like Codes
    Zhang, Wei
    Lentmaier, Michael
    Zigangirov, Kamil Sh.
    Costello, Daniel J., Jr.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (01) : 316 - 331
12345