scientific article; zbMATH DE number 1542867

MaRDI QIDQ4520322zbMATH OpenFDO

Authors Cristian Grozea, Cristian S. Calude

Publication date 26 February 2001

Full work available at URL http://www.jucs.org/jucs_2_5/kraft_chaitin_inequality_revisited

zbMATH Keywords

Kraft-Chaitin theoremnoiseless coding

Mathematics Subject Classification ID

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

Recommendations

• Publication:4942041
• scientific article; zbMATH DE number 1139964
• scientific article; zbMATH DE number 4209605
• scientific article; zbMATH DE number 166912
• On maximal prefix codes.

Cited in

(9)

• scientific article; zbMATH DE number 4209605 (Why is no real title available?)
• On maximal prefix codes.
• scientific article; zbMATH DE number 166912 (Why is no real title available?)
• scientific article; zbMATH DE number 1418479 (Why is no real title available?)
• A dynamical systems proof of Kraft-McMillan inequality and its converse for prefix-free codes
• Recursively enumerable reals and Chaitin \(\Omega\) numbers
• A characterization of c. e. random reals
• Calculus of cost functions
• The Kraus inequality for multivalent functions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4520322)