Entropic measures, Markov information sources and complexity (Q1855845)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Entropic measures, Markov information sources and complexity |
scientific article; zbMATH DE number 1861218
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Entropic measures, Markov information sources and complexity |
scientific article; zbMATH DE number 1861218 |
Statements
Entropic measures, Markov information sources and complexity (English)
0 references
28 January 2003
0 references
This paper, which could be thought of as a review paper, discusses Shannon's entropy and entropy rate for discrete and continuous Markov sources, with finite and continuous alphabets. After a prerequisite on some known results, it examines the relations between program-size complexity, algorithmic probability and entropy of Markov information sources with a binary alphabet and discrete time.
0 references
entropic measures
0 references
Shannon's entropy
0 references
entropy rate
0 references
Markov sources
0 references
complexity
0 references
algorithmic probability
0 references
Markov information sources
0 references
0.7880983352661133
0 references
0.7866948246955872
0 references
0.7583041787147522
0 references
