IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-030-22833-0_7.html
   My bibliography  Save this book chapter

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

In: Theory of Information and its Value

Author

Listed:
  • 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)

  • Ruslan L. Stratonovich

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.

Suggested Citation

  • Roman V. Belavkin & Panos M. Pardalos & Jose C. Principe & Ruslan L. Stratonovich, 2020. "Message transmission in the presence of noise. Second asymptotic theorem and its various formulations," Springer Books, in: Roman V. Belavkin & Panos M. Pardalos & Jose C. Principe (ed.), Theory of Information and its Value, chapter 0, pages 217-247, Springer.
    • Handle: RePEc:spr:sprchp:978-3-030-22833-0_7
    DOI: 10.1007/978-3-030-22833-0_7
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-030-22833-0_7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.