By Topic

'Diffuse' threshold decodable rate 1/2 convolutional codes

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)

This paper shows the existence (by construction) of ratefrac{1}{2}convolutional codes that correct bursts of lengthBortrandom errors. The codes have memory length and guard space requirements that are asymptotically4Band minimal effective length. Kohlenberg introduced the term "diffuse code" for his two random-error or single-burst error-correcting codes with minimal effective length and both a memory and guard-space requirement of3B + 1. To this point, there does not seem to be any procedure for finding codes with minimal effective length and guard space requirements asymptotically3B.

Published in:

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