Universal sequential coding of single messages (Q1112787): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 02:14, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Universal sequential coding of single messages |
scientific article |
Statements
Universal sequential coding of single messages (English)
0 references
1988
0 references
We define coding redundancy of single messages. A coding method is proposed which ensures a uniform bound on this redundancy for all messages on the output of a source with unknown statistical properties. Using the same criterion, we investigate the possibilities of sequential coding of messages, including messages on the output of a source with unknown statistical properties. Upper bounds on redundancy are obtained for memoryless sources, Markov chains, and various sets of Markov sources.
0 references
coding redundancy of single messages
0 references
sequential coding of messages
0 references
memoryless sources
0 references
Markov chains
0 references
Markov sources
0 references
