Source codes as random number generators

Karthik Visweswariah, Sanjeev Kulkarni, Sergio Verdú

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The use of optimal variable-length source codes as optimal random bit generators is investigated. We show in what sense source codes can be considered to be random bit generators.

Original languageEnglish (US)
Title of host publicationProceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997
Number of pages1
DOIs
StatePublished - Dec 1 1997
Event1997 IEEE International Symposium on Information Theory, ISIT 1997 - Ulm, Germany
Duration: Jun 29 1997Jul 4 1997

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8095

Other

Other1997 IEEE International Symposium on Information Theory, ISIT 1997
CountryGermany
CityUlm
Period6/29/977/4/97

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Source codes as random number generators'. Together they form a unique fingerprint.

  • Cite this

    Visweswariah, K., Kulkarni, S., & Verdú, S. (1997). Source codes as random number generators. In Proceedings - 1997 IEEE International Symposium on Information Theory, ISIT 1997 [613353] (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.1997.613353