Grammar-based codes: A new class of universal lossless source codes
Grammar-based codes: A new class of universal lossless source codes
复制标题
DOI：
10.1109/18.841160
复制
发表时间：
2000-05-01
影响因子：
2.5
通讯作者：
Yang, EH
中科院分区：
文献类型：
--
作者：
Kieffer, JC;Yang, EH
我们研究了一种称为基于语法的代码的无损源代码，该代码响应任何输入数据字符串A：在固定有限字母上，选择代表x的无竞赛语法G（x），即x是x属于G（x）生成的语言的独特弦，A：间接进行的无损压缩，IA的IA压缩语法G（x），这表明，受到某种温和限制，语法，基于有限的字母的有限状态信息源家族是一个通用代码。建立了基于语法的代码的冗余范围。介绍了设计基于语法的代码的减少规则。
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.