Large alphabets and incompressibility (Q845735): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2150359208 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: cs/0506056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An example of a computable absolutely normal number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Length of Programs for Computing Finite Binary Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Construction of Decimals Normal in the Scale of Ten / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on normal numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5834367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed representations of sequences and full-text indexes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressing probability distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A guided tour of Chernoff bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3597148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3214803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Information and Sufficiency / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of the Burrows—Wheeler transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting and Searching in Multisets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4800135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-adjusting binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal theory of inductive inference. Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002815 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:54, 2 July 2024

scientific article
Language Label Description Also known as
English
Large alphabets and incompressibility
scientific article

    Statements

    Large alphabets and incompressibility (English)
    0 references
    0 references
    29 January 2010
    0 references
    0 references
    analysis of algorithms
    0 references
    data compression
    0 references
    Kolmogorov complexity
    0 references
    Shannon's entropy
    0 references
    empirical entropy
    0 references
    normal numbers
    0 references
    de Bruijn sequences
    0 references
    threshold phenomena
    0 references
    self-information
    0 references
    Markov processes
    0 references
    relative entropy
    0 references
    birthday paradox
    0 references
    0 references
    0 references