A Survey on Grammar Based Compression
R. Easwaran

IISc-CSA-TR-2003-5
(June 2003)

Available formats: [ps] [ps.gz]

Filed on July 5, 2004
Updated on July 20, 2004


Recently, text compression has been viewed as the problem of getting
a compact grammar for the given string. Decompression involves getting
the string from the grammar. Most such approaches focus on getting a
grammar which produces exactly one string, the string which is compressed.
We survey a set of papers on this subject. Four of them analyze the
problem from an information theory point of view, by computing the
redundancy of these codes with other classes of codes. Two other
papers looks at whether the grammar based schemes exploit the
full power of the grammar model


Please bookmark this technical report as http://aditya.csa.iisc.ernet.in/TR/2003/5/.

Problems ? Contact techrep@csa.iisc.ernet.in
[Updated at 2009-10-22T06:42Z]