On Universal Noiseless Source Coding for Infinite Source Alphabets

László Györfi, István Páli, Edward C. Van Der Meulen

Research output: Article

18 Citations (Scopus)


We show that there is a universal noiseless source code for the class of all coun‐tably infinite memoryless sources for which a fixed given uniquely decodable code has finite expected codeword length. This source code is derived from a class of distribution estimation procedures which are consistent in expected information divergence.

Original languageEnglish
Pages (from-to)125-132
Number of pages8
JournalEuropean Transactions on Telecommunications
Issue number2
Publication statusPublished - jan. 1 1993

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this