Metraipolis › archive › dc_d2c899b44e5e
Typical set — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Typical_set
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T11:25:23.112Z
- SHA-256 of the archived text
bafdd72eeb730798aed0d299e7c5e901e14b276d90b23ab8ea71a75c0cb0c997- Stable URL of this page
https://metraipolis.com/documento/dc_d2c899b44e5e
How to cite
Typical set — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Typical_set (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_d2c899b44e5e (Metraipolis archive dc_d2c899b44e5e, sha256 bafdd72eeb730798aed0d299e7c5e901e14b276d90b23ab8ea71a75c0cb0c997)
BibTeX
@misc{dcd2c899b44e5e,
title = {Typical set — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Typical_set},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_d2c899b44e5e; sha256 bafdd72eeb730798aed0d299e7c5e901e14b276d90b23ab8ea71a75c0cb0c997},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Typical_set. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In information theory, the typical set is a set of sequences whose probability is approximately 2 − n H ( X ) {\displaystyle 2^{-nH(X)}} , where H ( X ) {\displaystyle H(X)} is the entropy of the source and n {\displaystyle n} is the sequence length. That this set has total probability close to one is a consequence of the asymptotic equipartition property (AEP) which is a kind of law of large numbers. The notion of typicality is only concerned with the probability of a sequence and not the actual sequence itself. This is of great importance in information theory and source coding as it provides a theoretical means for compressing data, allowing us to represent almost all sequences X n {\displaystyle X^{n}} using n H ( X ) {\displaystyle nH(X)} bits on average, and, hence, justifying the use of entropy as a measure of information from a source. The AEP can also be proven for a large class of stationary ergodic processes, allowing typical set to be defined in more general cases. Additionally, the typical set concept is foundational in understanding the limits of data transmission and error correction in communication systems. By leveraging the properties of typical sequences, efficient coding schemes like Shannon's source coding theorem and channel coding theorem are developed, enabling near-optimal data compression and reliable transmission over noisy channels.
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Probability theory»).
Fonte: Wikipedia in inglese, voce «Typical set» — https://en.wikipedia.org/wiki/Typical_set
Wikidata Q7861378 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q7861378
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Typical_set?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1378248857, consultata il 2026-10-07T11:16:06.685Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 4397b9e14eeb1bfdaa278a03ab6974a3f11f052ecb4ef5868114bba2a0bbc8a5