Some equivalences between Shannon entropy and Kolmogorov complexity
From MaRDI portal
Publication:4163107
DOI10.1109/TIT.1978.1055891zbMath0383.94014MaRDI QIDQ4163107
Sik K. Leung-Yan-Cheong, Thomas M. Cover
Publication date: 1978
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Complexity of computation (including implicit computational complexity) (03D15) Measures of information, entropy (94A17) Decoding (94B35) Prefix, length-variable, comma-free codes (94A45)
Related Items (11)
New lower bounds on the cost of binary search trees ⋮ Nonlinear transformation on the transfer entropy of financial time series ⋮ ON SOME INEQUALITIES AND GENERALIZED ENTROPIES: A UNIFIED APPROAC ⋮ On grammars, complexity, and information measures of biological macromolecules ⋮ Rough paths in idealized financial markets ⋮ Normalized information-based divergences ⋮ A note on Kolmogorov complexity and entropy ⋮ Some source coding theorems and 1:1 coding based on generalized inaccuracy measure of order \(\alpha \) and type \(\beta \) ⋮ Development of two new mean codeword lengths ⋮ An approach to the physics of complexity ⋮ Algorithmic analysis of irrational rotations in a single neuron model
This page was built for publication: Some equivalences between Shannon entropy and Kolmogorov complexity
