On Compressing Interchange Classes of Events in a Concurrent System

We consider universal compression schemes for a rate distortion problem in which the goal is to reproduce a string which is equivalent to the original string and we show that for a large collection of dependence alphabets we can asymptotically attain the interchange entropy, i.e., the rate distortion limit.