Optimal representation in average using Kolmogorov complexity

DOI10.1016/S0304-3975(97)00275-2zbMath0915.68093OpenAlexW2039147967MaRDI QIDQ1276258

Jean-Paul Delahaye, Eric Rivals

Publication date: 20 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00275-2

zbMATH Keywords

algorithmic complexity theory\(K\)-optimality on average

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Cites Work

• A Mathematical Theory of Communication
• Compression and Ranking
• A Method for the Construction of Minimum-Redundancy Codes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal representation in average using Kolmogorov complexity