By Topic

Asymptotic average redundancy of adaptive block 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)
Reznik, Y.A. ; RealNetworks Inc., Seattle, WA, USA ; Szpankowski, W.

Sample-based (or adaptive) block codes represent a transitional case: while the exact parameters of a source are not known, one can obtain finite length sequences of symbols (or samples) produced by this source in the past. It turns out, that using such samples it is possible to construct codes that are more efficient in encoding this particular source than pure universal codes. In order to be able to compare adaptive codes and codes for a known source more precisely one clearly needs to know the exact expression of an O (1/n). Obtaining the exact expression for this and subsequent terms describing the average behavior of adaptive block codes is the main goal of this paper.

Published in:

Information Theory, 2003. Proceedings. IEEE International Symposium on

Date of Conference:

29 June-4 July 2003