Journal article · 1991

The entropy theorem via coding bounds

Paul C. Shields

IEEE Transactions on Information Theory, 37(6), 1645–1647 · Published 1 January 1991 · DOI 10.1109/18.104325

View at the publisherCite this paper

In brief

“The entropy theorem via coding bounds” is a 1991 journal article by Paul C. Shields, published in IEEE Transactions on Information Theory. OpenAlex counts 4 citations as of 15 November 2026. The publisher's version is not open access, and OpenAlex records no free legal copy.

Citations
4
Most cited in
2024 (1)
References
5
Authors
1

Abstract

The entropy theorem (also known as the Shannon-McMillan-Breiman theory or the asymptotic equipartition theorem) asserts that, for a stationary ergodic finite alphabet process, the sequence-(1/n)log p(x/sub 1//sup n/) converges almost surely to the entropy-rate H of the process. The entropy theorem has been used to establish asymptotic bounds on the performance of noiseless codes. Here… Read the full abstract at the publisher.

Excerpt. This paper is not open access.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Shields, P. C. (1991). The entropy theorem via coding bounds. IEEE Transactions on Information Theory, 37(6), 1645–1647. https://doi.org/10.1109/18.104325

MLA 9

Shields, Paul C. “The entropy theorem via coding bounds.” IEEE Transactions on Information Theory, vol. 37, no. 6, 1991, pp. 1645–1647. https://doi.org/10.1109/18.104325.

Chicago

Shields, Paul C. 1991. “The entropy theorem via coding bounds.” IEEE Transactions on Information Theory 37 (6): 1645–1647. https://doi.org/10.1109/18.104325.

Harvard

Shields, P. C. (1991) ‘The entropy theorem via coding bounds’, IEEE Transactions on Information Theory, 37(6), pp. 1645–1647. doi:10.1109/18.104325.

IEEE

P. C. Shields, “The entropy theorem via coding bounds,” IEEE Transactions on Information Theory, vol. 37, no. 6, pp. 1645–1647, 1991, doi: 10.1109/18.104325.

BibTeX

@article{shields1991entropy,
  title     = {{The entropy theorem via coding bounds}},
  author    = {Shields, Paul C.},
  journal   = {IEEE Transactions on Information Theory},
  year      = {1991},
  volume    = {37},
  number    = {6},
  pages     = {1645--1647},
  doi       = {10.1109/18.104325},
  url       = {https://doi.org/10.1109/18.104325}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Topic and keywords

Physical Sciences › Mathematics › Mathematical Physics › Mathematical Dynamics and Fractals

  • Shannon-McMillan-Breiman theorem
  • entropy rate
  • stationary ergodic processes
  • source coding

Work with this paper

Most-cited papers in Mathematics

All highly cited Mathematics papers

Questions about this paper

How do I cite this paper in APA style?

Shields, P. C. (1991). The entropy theorem via coding bounds. IEEE Transactions on Information Theory, 37(6), 1645–1647. https://doi.org/10.1109/18.104325

How many times has this paper been cited?

4 times, according to OpenAlex on 15 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

OpenAlex records no free legal copy. Check your library's access, the authors' pages or a repository, or ask the corresponding author for a copy.

Who wrote this paper?

Paul C. Shields.

What is the DOI of this paper?

10.1109/18.104325. The permanent link is https://doi.org/10.1109/18.104325.

Bibliographic data from OpenAlex (CC0), last checked 15 November 2026. ResearchGuru does not host this paper; the links go to the publisher or the repository that does.