By Topic

Cutting and stacking: a method for constructing stationary processes

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)
Shields, P. ; Dept. of Math. Toledo Univ., OH, USA

Cutting and stacking, a general method for constructing examples of stationary, ergodic, finite-alphabet processes with desired properties, is described. It has been used to construct counterexamples in ergodic theory. Recently, it has also been used to construct examples of interest in information theory and probability theory. The method builds a stationary ergodic process by describing sample paths as concatenations of nonoverlapping blocks of varying lengths. Induction is used to show how these blocks are concatenated to form longer and longer blocks, and a geometric model is used to guarantee stationarity. The basic ideas of the method and some recent applications to information theory problems are described

Published in:

Information Theory, IEEE Transactions on  (Volume:37 ,  Issue: 6 )