By Topic

Burst-error-correcting convolutional codes with short constraint length (Corresp.)

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

2 Author(s)

A new class ofB 1codes which have an information rate of(b-1)/bforb=2,3,4, cdotsis presented. These codes correct error bursts up tobbits long when followed by a guard space of3b^{2} - 2b - 1bits. It is assumed that a hard decision is made on the fii sub-block ofbbits after one constraint length of the code is received and then feedback is used to modify the syndrome bits. One simplified decodhg scheme is described which uses simple logic for error correction. A detailed example is presented showing an application of the results. Several newB 1codes which meet the Wyner-Ash bound for minimum guard space are given. These codes were found by computer search.

Published in:

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