Message transmission in the presence of noise. Second asymptotic theorem and its various formulations

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 7 in Theory of Information and its Value, 2020, pp 217-247 from Springer

Abstract: Abstract In this chapter, we provide the most significant asymptotic results concerning the existence of optimal codes for noisy channels. It is proven that the Shannon’s amount of information is a bound on Hartley’s amount of information transmitted with asymptotic zero probability of error. This is the meaning of the second asymptotic theorem. Further we provide formulae showing how quickly the probability of error for decoding decreases when the block length increases. Contrary to the conventional approach, we represent the above results not in terms of channel capacity (i.e., we do not perform the maximization of the limit amount of information with respect to the probability density of the input variable), but in terms of Shannon’s amount of information.

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_7

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

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

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 ().