By Topic

Context-dependent vs. context-free: performance comparison of grammar-based codes

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)
En-hui Yang ; Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada ; Da-ke He

In this paper, we compare the performance of two types of universal data compression algorithms: context-dependent grammar-based (CDG-based) codes and context-free grammar-based (CFG-based) codes. The theoretical comparison of two algorithm is complicated by the following two facts observed: 1) Both CDG-based codes and CFG-based codes are universal for the class of stationary, ergodic sources with a finite alphabet; and 2) When the number of distinct contexts is upper bounded by a fixed number, the upper bounds on worst-case redundancy of CDG-based codes and CFG-based codes against any finite context arithmetic codes are in the same order of O(log log n/ log n). previously, two universal algorithms were compared only on the basis of some individual sequences. It was shown that for any sequential lossless code that is performable on a computer, there exists a sequence that is not compressible by the given code.

Published in:

Information Theory, 2003. Proceedings. IEEE International Symposium on

Date of Conference:

29 June-4 July 2003