Coding Theorems for Noisy Channels

  • Imre Csiszár
Part of the International Centre for Mechanical Sciences book series (CISM, volume 29)


Let us show first that the (weak) converse of the coding theorem holds for arbitrary (simple or compound) communication channels.


Noisy Channel Information Capacity Direct Part Finite Alphabet Compound Channel 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Wien 1970

Authors and Affiliations

  • Imre Csiszár
    • 1
  1. 1.Mathematical InstituteHungarian Academy of SciencesBudapestHungary

Personalised recommendations