By Topic

The redundancy of successive refinement codes and codes with side information

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
$33 $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)
G. Voronov ; Dept. of Electr. Eng.-Syst., Tel Aviv Univ., Israel ; M. Feder

We consider the problem of determining the redundancy of successive refinement codes and codes with side information, as a function of their blocklength. It is shown that successive refinement codes accumulate an O(logn/2n) redundancy term at each stage of the encoding process, which may result in a considerable degradation of the final description. Redundancy result for codes with side information is also presented

Published in:

Information Theory, 2000. Proceedings. IEEE International Symposium on

Date of Conference:

2000