On Pseudoentropy versus Compressibility

A source is compressible if we can efficiently compute short descriptions of strings in the support and efficiently recover the strings from the descriptions. A source has high pseudo-entropy if it is computationally distinguishable from a source of high entropy. In this paper, we present a technique for proving lower bounds on compressibility in an oracle setting, which yields the following results:

• Type: Conference
• Year: 2004
• Where: COCO
• Authors: Hoeteck Wee
• Keywords: COCO 2004, Compressible, Lower Bounds, Short Descriptions