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

By John C. Kieffer, E. Yang. IEEE Transactions on Information Theory, 2000

420 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Computational Theory and Mathematics, Molecular Biology

View Paper: https://www.semanticscholar.org/paper/15c3bdc536d180a7b8931e3453726aba2f9ca0a2

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

1. Dake He
2. E. Yang
3. John C. Kieffer

In Computational Theory and Mathematics

1. Dake He
2. E. Yang
3. John C. Kieffer

In Molecular Biology

1. Dake He
2. E. Yang
3. John C. Kieffer

Citations in the corpus

• Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform - Part one: Without context models (2000, methodology): “Remark 4: A different method for encoding canonical grammars has been presented in [12]; it is based on the concept of enumerative coding [6].”
• Efficient universal lossless data compression algorithms based on a greedy sequential grammar transform .2. With context models (2000, methodology): “It has been proved in [12] that if a grammar-based code transforms each data sequence into an irreducible context-free grammar, then the grammar-based code is universal for the class of stationary,”