By Topic

On the algorithmic foundation of information theory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

The information content of binary sequences is defined by minimal program complexity measures and is related to computable martingales. The equivalence of the complexity approach and the martingale approach after restriction to effective random tests is used to establish generalized source coding theorems and converses. Finite state complexity and decomposable martingales are related to classical block codes and the relative frequency behavior of sequences.

Published in:

Information Theory, IEEE Transactions on  (Volume:25 ,  Issue: 5 )