Entropic measures, Markov information sources and complexity (Q1855845): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57001704, #quickstatements; #temporary_batch_1711439739529
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Q3894827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4326782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CODING WITH MINIMAL PROGRAMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3995518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2709403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4942040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: RANDOMNESS AND COMPLEXITY IN PURE MATHEMATICS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kolmogorov's contributions to information theory and algorithmic complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5822308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some informational properties of Markov pure-jump processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the Beyer-Stein-Ulam relation between complexity and entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4158954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Continuous Time Markov Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4336750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic information and simplicity in statistical physics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical Theory of Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934359 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0096-3003(01)00199-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047066710 / rank
 
Normal rank

Latest revision as of 10:37, 30 July 2024

scientific article
Language Label Description Also known as
English
Entropic measures, Markov information sources and complexity
scientific article

    Statements

    Entropic measures, Markov information sources and complexity (English)
    0 references
    28 January 2003
    0 references
    This paper, which could be thought of as a review paper, discusses Shannon's entropy and entropy rate for discrete and continuous Markov sources, with finite and continuous alphabets. After a prerequisite on some known results, it examines the relations between program-size complexity, algorithmic probability and entropy of Markov information sources with a binary alphabet and discrete time.
    0 references
    entropic measures
    0 references
    Shannon's entropy
    0 references
    entropy rate
    0 references
    Markov sources
    0 references
    complexity
    0 references
    algorithmic probability
    0 references
    Markov information sources
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references