Prediction of random sequences and universal coding (Q1117199): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| (2 intermediate revisions by one other user not shown) | |||
| Property / author | |||
| Property / author: Boris Ya. Ryabko / rank | |||
| Property / author | |||
| Property / author: Boris Ya. Ryabko / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 02:16, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Prediction of random sequences and universal coding |
scientific article |
Statements
Prediction of random sequences and universal coding (English)
0 references
1988
0 references
The prediction is represented as a set of probability estimates of possible continuations of the stochastic process. The prediction problem is solved in two settings: 1) given that the sequence is computable or 2) given that the sequence is stationary. In mathematical terms, the problem is related to coding theory and its solution accordingly relies on known information-theoretical results.
0 references
prediction problem
0 references
coding theory
0 references
