Universal coding with minimum probability of codeword length overflow (Q3358638)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4210040
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Universal coding with minimum probability of codeword length overflow |
scientific article; zbMATH DE number 4210040 |
Statements
Universal coding with minimum probability of codeword length overflow (English)
0 references
1991
0 references
universal noiseless coding
0 references
Lempel-Ziv algorithm
0 references
length overflow
0 references
buffer overflow
0 references
finite-state sources
0 references
large deviations
0 references
competitive optimality
0 references
Lossless block-to-variable length source coding
0 references
finite-alphabet sources
0 references
Kraft inequality
0 references
unifilar Markov sources
0 references
0.8111639022827148
0 references
0.8012292385101318
0 references
0.7998618483543396
0 references
0.7930564284324646
0 references
