Encoding in the presence of penalties. First variational problem

Roman V. Belavkin, Panos M. Pardalos, Jose C. Principe and Ruslan L. Stratonovich
Additional contact information
Roman V. Belavkin: Middlesex University, Faculty of Science and Technology
Panos M. Pardalos: University of Florida, Industrial and Systems Engineering
Jose C. Principe: University of Florida, Electrical & Computer Engineering

Chapter Chapter 3 in Theory of Information and its Value, 2020, pp 53-75 from Springer

Abstract: Abstract The amount of information that can be recorded or transmitted is defined by a logarithm of the number of various recording realizations or transmission realizations, respectively. However, calculation of this number is not always a simple task. It can be complicated because of the presence of some constraints imposed on feasible realizations. In many cases, instead of direct calculation of the number of realizations, it is reasonable to compute the maximum value of recording entropy via maximization over distributions compatible with conditions imposed on the expected value of some random cost. This maximum value of entropy is called the capacity of a channel channel capacity without noise. This variational problem is the first from the set of variational problems playing an important role in information theory.

Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-030-22833-0_3

Ordering information: This item can be ordered from
http://www.springer.com/9783030228330

DOI: 10.1007/978-3-030-22833-0_3

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().