Entropic measures, Markov information sources and complexity (Q1855845): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:56, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Entropic measures, Markov information sources and complexity |
scientific article |
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
