Skip to main content

Generalizations of the Maximum Entropy Principle and their Applications

  • Chapter
Transactions of the Ninth Prague Conference

Part of the book series: Czechoslovak Academy of Sciences ((TPCI,volume 9A))

  • 148 Accesses

Abstract

Three inequalities closely related to the principle of maximum entropy and analogous principles are presented. They are applied to various problems of universal encoding and decoding.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  • Davisson, L.D. (1973): Universal noiseless coding. IEEE Trans. Inform. Theory IT-19, 783–795

    Article  MathSciNet  Google Scholar 

  • Fischer, Th. (1977): Ãœber Verallgemeinerungen der Bongard-Entropie und Codierungssätze für Quellen mit unbekanntem statistischen Verhalten (On generalizations of the Bongard entropy and coding theorems for unknown source statistics). EIK 13, 125–135

    Google Scholar 

  • Fischer, Th. (1978): Some remarks on the role of inaccuracy in Shannon’s theory of information transmission. In: Trans. of the Eighth Prague Conference, Prague 1978. Academia, Prague, Vol. A, 211–226

    Google Scholar 

  • Fischer, Th. (1981): Das Prinzip der maximalen Entropie und seine Anwendung in der Codierungs- und Suchtheorie (On the principle of maximum entropy and its applications to coding and search theory), to appear

    Google Scholar 

  • Krichevsky, R.E.; Trofimov, V.K. (1981): The performance of universal encoding. IEEE Trans. Inform. Theory IT-27, 199–207

    Article  MathSciNet  Google Scholar 

  • Rényi, A. (1966): On the amount of missing information and the Neyman - Pearson lemma. In: Festschrift für J. Neyman. Wiley, London, 281–288

    Google Scholar 

  • Stiglitz, I.G. (1967): A coding theorem for a class of unknown channels. IEEE Trans. Inform. Theory IT- 13, 217–220

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1983 ACADEMIA, Publishing House of the Czechoslovak Academy of Sciences, Prague

About this chapter

Cite this chapter

Fischer, T. (1983). Generalizations of the Maximum Entropy Principle and their Applications. In: Transactions of the Ninth Prague Conference. Czechoslovak Academy of Sciences, vol 9A. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-7013-7_27

Download citation

  • DOI: https://doi.org/10.1007/978-94-009-7013-7_27

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-94-009-7015-1

  • Online ISBN: 978-94-009-7013-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics