Skip to main content

Information theory in random fields

  • Conference paper
  • First Online:
Coding Theory and Applications (Coding Theory 1986)

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

Included in the following conference series:

Abstract

A random field is a family of random variables with a multidimensional parameter set. Random fields provide mathematical models for distributed sources of information. Channels that link an input and an output random field also are of interest.

First, we describe in detail a celebrated result of random field theory to the effect that a random field has the Markov property if and only if it is a Gibbs state with a nearest neighbor potential. Next we lower bound the zero-error capacity of a certain binary random field channel by developing an efficient zero-error coding scheme. Finally, we consider algorithms for computing the stationary distribution of a time evolution mechanism. These algorithms, which have long been employed in mathematical statistical mechanics, also play a central role in simulated annealing.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. J. Preston, Gibbs States on Countable Sets, Cambridge Tracts, Cambridge University Press, 1974.

    Google Scholar 

  2. B. Hajek and T. Berger, ”A Decomposition Theorem for Binary Markov Random Fields, Annals of Probability, vol. 15, no. 3, pp. 1112–1125, July 1987.

    Google Scholar 

  3. S. Kirkpatrick, et al., Optimization by Simulated Annealing, Science, vol. 220, pp. 671–679, 1983.

    Google Scholar 

  4. B. Hajek, Cooling Schedules for Simulated Annealing, preprint, University of Illinois, Coordinated Science Laboratory, submitted to Mathematics of Operations Research.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

G. Cohen P. Godlewski

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Berger, T. (1988). Information theory in random fields. In: Cohen, G., Godlewski, P. (eds) Coding Theory and Applications. Coding Theory 1986. Lecture Notes in Computer Science, vol 311. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19368-5_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-19368-5_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19368-5

  • Online ISBN: 978-3-540-39243-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics