2021/10/13 by Adeel Mahmood, Mahmood, Adeel, Aaron B. Wagner +1 · 1 citation
Computer Science · Engineering · #Advanced Data Compression Techniques #FOS: Computer and information sciences #Information Theory (cs.IT) #Sparse and Compressive Sensing Techniques #Wireless Communication Security Techniques
paper · pdf · doi:10.48550/arxiv.2110.07022
openalex publication_date 2021/10/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider a novel variant of d-semifaithful lossy coding in which the distortion measure is revealed only to the encoder and only at run-time, as well as an extension of it in which the distortion constraint d is also revealed at run-time. Two forms of rate redundancy are used to analyze the performance, and achievability results of both a pointwise and minimax nature are demonstrated. The first coding scheme uses ideas from VC dimension and growth functions, the second uses appropriate quantization of the space of distortion measures, and the third relies on a random coding argument.