A lower bound on compression of unknown alphabets (Q1770393): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 08:36, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A lower bound on compression of unknown alphabets |
scientific article |
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
