Entropic measures, Markov information sources and complexity
type: Item
instance of: scholarly article
title: Entropic measures, Markov information sources and complexity
zbMATH Open document ID: 1029.94008
DOI: 10.1016/S0096-3003(01)00199-0
author: Cristian S. Calude
author: Monica Dumitrescu
published in: Applied Mathematics and Computation
publication date: 2003-01-28T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 94A17
Mathematics Subject Classification ID: 68Q30
Mathematics Subject Classification ID: 60J10
Mathematics Subject Classification ID: 60J27
Mathematics Subject Classification ID: 62B10
zbMATH DE Number: 1861218
zbMATH Keywords: entropic measures
zbMATH Keywords: Shannon's entropy
zbMATH Keywords: entropy rate
zbMATH Keywords: Markov sources
zbMATH Keywords: complexity
zbMATH Keywords: algorithmic probability
zbMATH Keywords: Markov information sources
reviewed by: Guy Jumarie
MaRDI profile type: Publication
Wikidata QID: Q57001704
cites work: Q3894827
cites work: Q4326782
cites work: CODING WITH MINIMAL PROGRAMS
cites work: Q3995518
cites work: Information, randomness and incompleteness. Papers on algorithmic information theory
cites work: Q4942040
cites work: Q4259438
cites work: RANDOMNESS AND COMPLEXITY IN PURE MATHEMATICS
cites work: Kolmogorov's contributions to information theory and algorithmic complexity
cites work: Q4023085
cites work: Q5822308
cites work: Some informational properties of Markov pure-jump processes
cites work: Q4074808
cites work: A proof of the Beyer-Stein-Ulam relation between complexity and entropy
cites work: Q4158954
cites work: Q4003734
cites work: Finite Continuous Time Markov Chains
cites work: Q4336750
cites work: Algorithmic information and simplicity in statistical physics
cites work: A Mathematical Theory of Communication
cites work: Q4040892
cites work: Q4934359
full work available at URL: s0096-3003(01)00199-0
OpenAlex ID: W2047066710
description: scientific article; zbMATH DE number 1861218