On hierarchical type covering

作     者：Tuncel, E Nayak, J Rose, K 

作者机构：Univ Calif Riverside Dept Elect Engn Riverside CA 92521 USA Univ Calif Santa Barbara Dept Elect & Comp Engn Santa Barbara CA 93106 USA 

出 版 物：《IEEE TRANSACTIONS ON INFORMATION THEORY》 (IEEE Trans. Inf. Theory)

年 卷 期：2005年第51卷第12期

页      面：4405-4418页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Applied Signal Technology, Inc Dolby Laboratories, Inc Qualcomm, Inc National Science Foundation, NSF, (EIA-0080134, IIS-0329267) University of California, UC 

主　　题：hierarchical guessing hierarchical type covering scalable source coding 

摘      要：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.