On universal noiseless source coding for infinite source alphabets

L. Györfi, Istvan Pali, Edward C. van der Meulen

Research output: Contribution to journalArticle

18 Citations (Scopus)

Abstract

We show that there is a universal noiseless source code for the class of all countably 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 and related technologies
Volume4
Issue number2
Publication statusPublished - Mar 1993

ASJC Scopus subject areas

  • Engineering(all)

Cite this

On universal noiseless source coding for infinite source alphabets. / Györfi, L.; Pali, Istvan; van der Meulen, Edward C.

In: European transactions on telecommunications and related technologies, Vol. 4, No. 2, 03.1993, p. 125-132.

Research output: Contribution to journalArticle

@article{31a979f158b8490b88efb91e898a5e71,
title = "On universal noiseless source coding for infinite source alphabets",
abstract = "We show that there is a universal noiseless source code for the class of all countably 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.",
author = "L. Gy{\"o}rfi and Istvan Pali and {van der Meulen}, {Edward C.}",
year = "1993",
month = "3",
language = "English",
volume = "4",
pages = "125--132",
journal = "Transactions on Emerging Telecommunications Technologies",
issn = "2161-5748",
publisher = "John Wiley and Sons Ltd",
number = "2",

}

TY - JOUR

T1 - On universal noiseless source coding for infinite source alphabets

AU - Györfi, L.

AU - Pali, Istvan

AU - van der Meulen, Edward C.

PY - 1993/3

Y1 - 1993/3

N2 - We show that there is a universal noiseless source code for the class of all countably 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.

AB - We show that there is a universal noiseless source code for the class of all countably 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.

UR - http://www.scopus.com/inward/record.url?scp=0027557915&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027557915&partnerID=8YFLogxK

M3 - Article

VL - 4

SP - 125

EP - 132

JO - Transactions on Emerging Telecommunications Technologies

JF - Transactions on Emerging Telecommunications Technologies

SN - 2161-5748

IS - 2

ER -