A lower bound on compression of unknown alphabets (Q1770393): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.10.038 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2127887726 / rank | |||
Normal rank | |||
Revision as of 21:57, 19 March 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
