Skip to main content
SpringerLink
Log in

Algorithms for Computing Channel Capacities and Rate-Distortion Functions

  • Chapter
  • First Online:
Transmitting and Gaining Data

Part of the book series: Foundations in Signal Processing, Communications and Networking ((SIGNAL,volume 11))

  • 705 Accesses

Abstract

Computation of the capacity \(C=C(W)\) of a DMC \(W:{\mathcal X}\rightarrow {\mathcal Y}\) involves the solution of a convex programming problem.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. S. Arimoto, An algorithm for computing the capacity of arbitrary discrete memoryless channels. IEEE Trans. Inf. Theory IT–18, 14–20 (1972)

    Article  MathSciNet  Google Scholar 

  2. R.E. Blahut, Computation of channel capacity and rate-distortion functions. IEEE Trans. Inf. Theory IT–18, 460–473 (1972)

    Article  MathSciNet  Google Scholar 

  3. I. Csiszár, On the computation of rate-distortion functions. IEEE Trans. Inf. Theory IT–20, 122–124 (1974)

    Article  Google Scholar 

  4. I. Csiszár, P.C. Shields, Iterative algorithms chapter 5 information theory and statistics: a tutorial. Found. Trends Commun. Inf. Theory 1(4), 417–528 (2004)

    Article  Google Scholar 

  5. B. Meister, W. Oettli, On the capacity of a discrete, constant channel. Inf. Control 11, 341–351 (1967)

    Article  MATH  Google Scholar 

  6. S. Muroga, On the capacity of a discrete channel I. J. Phys. Soc. Jpn. 8, 484–494 (1953)

    Article  MathSciNet  Google Scholar 

  7. C.E. Shannon, Geometrische Deutung einiger Ergebnisse beider Berechnung der Kanalkapazität. Nachrichtentechn. Z. 1, 1–4 (1957)

    Google Scholar 

  8. W. Weaver, C.E. Shannon, The Mathematical Theory of Communication (University of Illinois Press, Urbana, 1963)

    Google Scholar 

Further Reading

  1. T. Berger, Rate Distortion Theory: A Mathematical Basis for Data Compression (Prentice-Hall, Englewood Cliffs, 1971)

    Google Scholar 

  2. R.E. Blahut, An hypothesis-testing approach to information theory, Ph.D. Dissertation, Department of Electrical Engineering Cornell University, Ithaca, New York (1972)

    Google Scholar 

  3. P. Boukris, An upper bound on the speed of convergence of the Blahut algorithm for computing rate-distortion functions. IEEE Trans. Inf. Theory IT–19, 708–709 (1973)

    Article  MathSciNet  Google Scholar 

  4. I. Csiszár, G. Tusnady, Information geometry and alternating minimization procedures. Stat. Decis. Suppl. Issue 1, 205–237 (1984)

    Google Scholar 

  5. F. Topsø, An information theoretic identity and a problem involving capacity. Stud. Sci. Math. Hungar. 2, 291–292 (1967)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Mathematics, University of Bielefeld, Bielefeld, Germany

    Rudolf Ahlswede

  2. Bielefeld, Germany

    Alexander Ahlswede

  3. Friedrich-Schiller University, Jena, Germany

    Ingo Althöfer

  4. University of Bielefeld, Bielefeld, Germany

    Christian Deppe

  5. Bielefeld University of Applied Sciences, Bielefeld, Germany

    Ulrich Tamm

Authors
  1. Rudolf Ahlswede
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alexander Ahlswede
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ingo Althöfer
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Christian Deppe
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ulrich Tamm
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christian Deppe .

Editor information

Editors and Affiliations

  1. Bielefeld, Germany

    Alexander Ahlswede

  2. Faculty Mathematics and Comp. Science, Friedrich-Schiller-University Jena, Jena, Germany

    Ingo Althöfer

  3. Faculty of Mathematics, University of Bielefeld, Bielefeld, Germany

    Christian Deppe

  4. Applied Math., Stat., Quant. Methods, Bielefeld University of Appl. Scien, Bielefeld, Germany

    Ulrich Tamm

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Ahlswede, R., Ahlswede, A., Althöfer, I., Deppe, C., Tamm, U. (2015). Algorithms for Computing Channel Capacities and Rate-Distortion Functions. In: Ahlswede, A., Althöfer, I., Deppe, C., Tamm, U. (eds) Transmitting and Gaining Data. Foundations in Signal Processing, Communications and Networking, vol 11. Springer, Cham. https://doi.org/10.1007/978-3-319-12523-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12523-7_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12522-0

  • Online ISBN: 978-3-319-12523-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation