Technical Program

Paper Detail

Paper Title Universal D-Semifaithfull Coding for Countably Infinite Alphabets
Paper IdentifierMO4.R4.3
Authors Jorge F. Silva, Universidad de Chile, Chile; Pablo Piantanida, CentraleSupélec-CNRS-Universite Paris Sud, France
Session Universal Compression
Location Odéon, Level 3
Session Time Monday, 08 July, 16:40 - 18:00
Presentation Time Monday, 08 July, 17:20 - 17:40
Manuscript  Click here to download the manuscript
Abstract The problem of fixed-distortion universal source coding (or universal D-semifaithfull source coding) for stationary and memoryless sources on countably infinite alphabets is investigated. The main result of this paper offers sufficient conditions to achieve strong and weak minimax universality for D-semifaithfull source coding of any memoryless source defined by an envelope function on infinite alphabets. It is also shown that universal D-semifaithfull source coding is not feasible for the complete family of memoryless sources. Furthermore, a sufficient condition for impossibility is presented for the family of envelope distributions.