### Abstract

The vast majority of results in information theory is on situations where the actual probability law is known. Applying information theory in real life problems, there is an obvious question whether the probability law can be learned from data as far as information theory is concerned. This paper is on coding for a discrete infinite source alphabet showing that there is no universal source code over the class of discrete memoryless sources with infinite source alphabet and finite entropy.

Original language | English |
---|---|

Title of host publication | Proceedings of the 1993 IEEE International Symposium on Information Theory |

Publisher | Publ by IEEE |

Number of pages | 1 |

ISBN (Print) | 0780308786 |

Publication status | Published - Jan 1 1993 |

Event | Proceedings of the 1993 IEEE International Symposium on Information Theory - San Antonio, TX, USA Duration: Jan 17 1993 → Jan 22 1993 |

### Publication series

Name | Proceedings of the 1993 IEEE International Symposium on Information Theory |
---|

### Other

Other | Proceedings of the 1993 IEEE International Symposium on Information Theory |
---|---|

City | San Antonio, TX, USA |

Period | 1/17/93 → 1/22/93 |

### ASJC Scopus subject areas

- Engineering(all)

## Fingerprint Dive into the research topics of 'There is no universal source code for infinite alphabet'. Together they form a unique fingerprint.

## Cite this

Gyoerfi, L., Pali, I., & van der Meulen, E. C. (1993). There is no universal source code for infinite alphabet. In

*Proceedings of the 1993 IEEE International Symposium on Information Theory*(Proceedings of the 1993 IEEE International Symposium on Information Theory). Publ by IEEE.