By Topic

The compression performance of grammar-based codes revisited

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Da-ke He ; Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada ; En-hui Yang

A grammar-based code (GC) refers to a new type of universal lossless source code. The authors consider the following two questions: (1) Based on run-length encoding (RLE) can one propose a class of interesting algorithms which is superior to arithmetic coding (AC) algorithms with finite contexts and can also be used as a benchmark to evaluate GCs? (2) For each sequence x, is there a better quantity than rk*(x) such that it can be used to derive a stronger redundancy bound for GCs? They show that the answer to both questions is yes and summarize the main results.

Published in:

Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on

Date of Conference: