Scheduled System Maintenance on May 29th, 2015:
IEEE Xplore will be upgraded between 11:00 AM and 10:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Efficient Communication through Burst-Error Channels by Means of Error Detection

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)
Horstein, M. ; Space Systems Div., Hughes Aircraft Co., El Segundo, CA

Two error detection techniques are examined with a view toward maximizing the average rate at which information can be transmitted reliably through a burst-error channel. It is assumed that the time required for transmission of a block of channel symbols varies linearly with the block length. For the three-parameter family of Gilbert burst-error channels, the block length that maximizes the information rate can be found from a single composite channel parameter, which may be interpreted as the error rate of an equivalent binary symmetric channel (BSC). For one of the error detection techniques, which uses a separately coded accept/reject (A/R) signal, the construction of and decision rule for an A/R code-word pair which includes a fail-safe feature are derived for the BSC. For the second type of system, in which an A/R bit is added to each information block, it is shown that interchannel correlation has little effect on system performance.

Published in:

Communication Technology, IEEE Transactions on  (Volume:14 ,  Issue: 2 )