On hierarchical type covering

Authors:
E. Tuncel;J. Nayak;K. Rose
Affiliations:
Dept. of Electr. Eng., Univ. of California, Riverside, CA, USA;-;-
Venue:
IEEE Transactions on Information Theory
Year:
2005

Citing 0
Cited 1

The rate transfer argument in two-stage scenarios: when does it matter?

ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1

Quantified Score

Hi-index	754.84

Visualization

Abstract

This correspondence focuses on a significant distinction between two hierarchical type covering strategies, namely, weak and strong covering, and on the impact of this distinction on known results. In particular, it is demonstrated that the rate region for weak covering, whose natural use is in scalable source coding, is generally larger than the rate region for strong covering, which is primarily useful in hierarchical guessing. This correspondence also presents a corrected converse result for the hierarchical guessing problem.