A lower bound on compression of unknown alphabets (Q1770393): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 05:37, 5 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
    0 references
    0 references
    0 references
    6 April 2005
    0 references
    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