About adaptive coding on countable alphabets: max-stable envelope classes
About adaptive coding on countable alphabets: max-stable envelope classes
In this paper, we study the problem of lossless universal source coding for stationary memoryless sources on countably infinite alphabets. This task is generally not achievable without restricting the class of sources over which universality is desired. Building on our prior work, we propose natural families of sources characterized by …