The DOI matches its Crossref record.
Entropy and Information
Abstract
This chapter is devoted to the concepts of Shannon entropy and mutual information as well as their conditional variants, collectively called Shannon information measures. It considers Shannon information measures for discrete stationary processes, where the block entropy, the entropy rate, and the excess entropy are introduced. The chapter explains that Shannon information measures for fields inherit all nice properties of Shannon information measures for partitions and additionally, they enjoy continuity, which allows to define entropy rate and excess entropy using infinitely long blocks. It derives ergodic decomposition formulas for entropy rate and excess entropy. The chapter helps the reader to understand processes with the zero entropy rate and disproving a strong form of Hilberg’s hypothesis, which demands that natural language has a zero entropy rate indeed. It analyze processes that have uncountably many ergodic components.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Permutation Entropy and Its Main Biomedical and Econophysics Applications: A Review
Zanin, M., Zunino, L., Rosso, O. A., & Papo, D. (2012) · Entropy · doi:10.3390/e14081553 · Cited by 634
Informational laws of genome structures
Bonnici, V., & Manca, V. (2016) · Scientific Reports · doi:10.1038/srep28840 · Cited by 38
Metadata
- Venue
- Information Theory Meets Power Laws
- Publisher
- Wiley
- Published
- 2020-09-14
- Pages
- 131-165
- OpenAlex
- W2095674846
- Cited by
- 187
- References
- 0
- Type
- other
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Entropy and Information. https://app.cochat.ai/papers/10.1002/9781119625384.ch5
- The paper
- Entropy and Information. (2020). Information Theory Meets Power Laws. https://doi.org/10.1002/9781119625384.ch5
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.