-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...
—In this contribution, duals of fountain codes are introduced and their use for lossy source compression is investigated. It is shown both theoretically and experimentally that t...
Dino Sejdinovic, Robert J. Piechocki, Angela Doufe...
Abstract—We consider the problem of side-information scalable (SI-scalable) source coding, where the encoder constructs a two-layer description, such that the receiver with high ...
A quantitative approach for measuring and describing feature interactions in object-oriented software components based on source code inspection is presented. The methodical arsen...
Abstract-- We analyze the performance of low-density generator matrix (LDGM) codes for lossy source coding. We first develop a generic technique for deriving lower bounds on the ef...
Alexandros G. Dimakis, Martin J. Wainwright, Kanna...