A lower bound on compression of unknown alphabets (Q1770393)

From MaRDI portal
Revision as of 20:15, 7 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references