By Topic

Chernoff bound for channels with infinite memory

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 problem of Chernoff bounding is analyzed for symmetric channels with input alphabet of arbitrary finite size or erasure channels with no crossover errors whose memory may be described in terms of the noise sequences by an infinite ergodic irreducible aperiodic Markov chain. Necessary and sufficient conditions are described which guarantee the existence of an exponential upper bound to the probability of error for block coding. These conditions are given in terms of the transition matrix of the Markov chain. It will be observed that, although their application involves merely an inspection of the transition matrix, they are based on the topology of the Markov chain and the convergence of sequences of transition probabilities.

Published in:

Information Theory, IEEE Transactions on  (Volume:13 ,  Issue: 3 )