Skip to main content
Log in

On the coding theorem and its converse for finite-memory channels

  • Seminars
  • Published:
Il Nuovo Cimento (1955-1965)

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. A. Feinstein:Foundations of Information Theory, (New York, 1958).

  2. J. Nedoma:The Capacity of a Discrete Channel, Trans. First Prague Conference on Information Theory, Statistical Decision Functions, Random Process (1956).

  3. I. P. Tsaregradsky:On the Capacity of a Stationary Channel with Finite Memory (in Russian), inTheory of Probability and its Applications,3, 84 (1948).

    Google Scholar 

  4. J. Wolfowitz:The Coding of Messages Subject to Chance Errors, inIllinois Jour. of Math.,1, 591 (Dec. 1957);An Upper Bound on the Rate of Transmission of Messages, inIllinois Journ. of Math.,2, 137 (March. 1958).

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was carried out at Stanford University, Stanford, Cal. and was supported in part by the Office of Naval Research, United States Navy.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Feinstein, A. On the coding theorem and its converse for finite-memory channels. Nuovo Cim 13 (Suppl 2), 560–575 (1959). https://doi.org/10.1007/BF02724686

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02724686

Navigation