Local Grammar-Based Coding Revisited

09/27/2022
by   Łukasz Dębowski, et al.
2

We revisit the problem of minimal local grammar-based coding. In this setting, the local grammar encoder encodes grammars symbol by symbol, whereas the minimal grammar transform minimizes the grammar length in a preset class of grammars as given by the length of local grammar encoding. It is known that such minimal codes are strongly universal for a strictly positive entropy rate, whereas the number of rules in the minimal grammar constitutes an upper bound for the mutual information of the source. Whereas the fully minimal code is likely intractable, the constrained minimal block code can be efficiently computed. In this note, we present a new, simpler, and more general proof of strong universality of the minimal block code, regardless of the entropy rate. The proof is based on a simple Zipfian bound for ranked probabilities. By the way, we also show empirically that the number of rules in the minimal block code cannot clearly discriminate between long-memory and memoryless sources, such as a text in English and a random permutation of its characters. This contradicts our previous expectations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/23/2016

A note on the expected minimum error probability in equientropic channels

While the channel capacity reflects a theoretical upper bound on the ach...
research
03/10/2020

On a Class of Markov Order Estimators Based on PPM and Other Universal Codes

We investigate a class of estimators of the Markov order for stationary ...
research
03/18/2020

Grammar compression with probabilistic context-free grammar

We propose a new approach for universal lossless text compression, based...
research
04/23/2018

Entropy bounds for grammar compression

In grammar compression we represent a string as a context free grammar. ...
research
01/19/2009

An Upper Limit of AC Huffman Code Length in JPEG Compression

A strategy for computing upper code-length limits of AC Huffman codes fo...
research
07/03/2018

How long can optimal locally repairable codes be?

A locally repairable code (LRC) with locality r allows for the recovery ...
research
11/08/2012

3D Scene Grammar for Parsing RGB-D Pointclouds

We pose 3D scene-understanding as a problem of parsing in a grammar. A g...

Please sign up or login with your details

Forgot password? Click here to reset