A lower bound on compression of unknown alphabets (Q1770393)
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 2153189
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound on compression of unknown alphabets |
scientific article; zbMATH DE number 2153189 |
Statements
A lower bound on compression of unknown alphabets (English)
0 references
6 April 2005
0 references
Large and unknown alphabets
0 references
Patterns
0 references
Saddle point approximations
0 references
Hayman's theorem
0 references
Universal compression
0 references
0.9005029201507568
0 references
0.8801264762878418
0 references
0.8793958425521851
0 references
0.8484286665916443
0 references
0.8340862393379211
0 references
