By Topic

An Upper Bound for the Error Probability on the Gilbert Channel

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)
Cuperman, V. ; Simon Fraser Univ., Burnaby, BC, Canada

The binary symmetrical channel with memory (Gilbert model) allows a satisfactory approximation of the error distribution on real channels characterized by error bursts. Its use is, however, relatively limited due to the computing involvemeats, which usually lead to the programming of the respective problems on a computer. Two manners of simplifying the computation of the probabilityP(m,n)ofmerrors in a code word of lengthn, are shown. The first manner is based on deducing a direct relation by means of the method of the generating function and simplifying it on the basis of the existing inequalities among the usual values of the Gilbert channel parameters. The second manner is based on deducing an upper bound for theP(m,n)probability on the Gilbert channel. The formulas deduced allow simplification of the computation of the performance of the error correcting and detecting codes on the Gilbert channel.

Published in:

Communication Technology, IEEE Transactions on  (Volume:17 ,  Issue: 5 )