Universal D-Semifaithfull Coding for Countably Infinite Alphabets
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.
Más información
Título según WOS: | Universal D-Semifaithfull Coding for Countably Infinite Alphabets |
Título de la Revista: | 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT) |
Editorial: | IEEE |
Fecha de publicación: | 2019 |
Página de inicio: | 567 |
Página final: | 571 |
DOI: |
10.1109/isit.2019.8849410 |
Notas: | ISI |