Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1994: STACS 94 pp 699–708Cite as

A new approach to information theory

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 775))

Abstract

The fundamental contribution of this work is to show that it is possible to change the way that we view the basic question of sending information over channel. In particular we can show that codes that are only good on “average” suffice for worst case performance provided the channel is restricted to be a feasible one. These methods have recently been used to show that one can give a “constructive” proof to Shannon's Theorem for any feasible channel [5].

Supported in part by NSF CCR-9304718

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Babai, L., Fortnow L., Levin, L.A., Szegedy M. Checking computations in polylogarithmic time, in Proc. of the 23rd Annual Symp. on Theory of Computing, 21–31, 1991.

    Google Scholar 

  2. Berelekamp, E.R. Algebraic Coding Theory. New York: McGraw-Hill, 1968.

    Google Scholar 

  3. Blum, M. and Micali, S. How to generate cryptographically strong sequences of pseudorandom bits. IEEE FOCS 23, 112–117, 1982.

    Google Scholar 

  4. Diffie, W. and Hellman, M.E. New directions in cryptography. IEEE Trans. Info. Theory 22, 644–654, 1976.

    Google Scholar 

  5. Lipton, R. On Coding for Noisy Feasible Channels, unpublished manuscript, 1993.

    Google Scholar 

  6. Lagararias, J. C. Pseudorandom Numbers in Probability and Algorithms, National Research Council, 1992.

    Google Scholar 

  7. MacWilliams, J., and Sloane, N.J.A. The Theory of Error Correcting Codes. (Elsevier, American ed.) Amsterdam: North-Holland, 1977.

    Google Scholar 

  8. McEliece, R.J. The Theory of Information and Coding. Reading, Mass: Addison Wesley, 1977.

    Google Scholar 

  9. Shannon, C.E. A mathematical theory of communication. Bell System Tech. J. 27, 379–423 and 623–656, 1948.

    Google Scholar 

  10. Dominic, W. Codes and Cryptography Oxford, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Princeton University, 08544, Princeton, NJ

    Richard J. Lipton

Authors
  1. Richard J. Lipton
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Patrice Enjalbert Ernst W. Mayr Klaus W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lipton, R.J. (1994). A new approach to information theory. In: Enjalbert, P., Mayr, E.W., Wagner, K.W. (eds) STACS 94. STACS 1994. Lecture Notes in Computer Science, vol 775. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57785-8_183

Download citation

  • DOI: https://doi.org/10.1007/3-540-57785-8_183

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57785-0

  • Online ISBN: 978-3-540-48332-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation