By Topic

A binary channel characterization using partitioned Markov chains

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
$33 $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 characterization of binary communication channels using functions of finite-state Markov chains is considered. Two distributions which are relevant to code evaluation, i.e., the error-free run and error-cluster distributions, are derived. It is shown for an N -state model, partitioned into a group of k error-free states and N-k error states, that the general form of the error-free run distribution is the weighted sum of at most k exponentials, and that of the error-cluster distribution the weighted sum of at most N-k exponentials. As evidence of the capability of such models to characterize real communication channels, a simple class of models is investigated and shown experimentally to be capable of representing HF radio statistics.

Published in:

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