On hierarchical type covering
This paper describes the guessing subject to rate-distortion theory. The concept of type covering is the set of vectors with the identical distortion balls. The main use of hierarchical type covering was the determination of achievable error exponents in scalable source coding. Weak covering is sufficient for that purpose. Strong covering is necessary for hierarchical guessing. The two covering strategies and their characterizations lead to different rate regions.