DocumentCode :
915373
Title :
´Diffuse´ threshold decodable rate 1/2 convolutional codes
Author :
Ferguson, Michael J.
Volume :
17
Issue :
2
fYear :
1971
fDate :
3/1/1971 12:00:00 AM
Firstpage :
171
Lastpage :
180
Abstract :
This paper shows the existence (by construction) of rate 
convolutional codes that correct bursts of length 
or 
random errors. The codes have memory length and guard space requirements that are asymptotically 
and 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 of 
. To this point, there does not seem to be any procedure for finding codes with minimal effective length and guard space requirements asymptotically 
.
convolutional codes that correct bursts of length or random errors. The codes have memory length and guard space requirements that are asymptotically and 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 of . To this point, there does not seem to be any procedure for finding codes with minimal effective length and guard space requirements asymptotically .Keywords :
Burst-correcting codes; Convolutional codes; Threshold decoding; Convolutional codes; Decoding; Error correction codes; Feedback; Gaussian noise; Memory management; Parity check codes; Sequential analysis; Viterbi algorithm; White noise;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1971.1054603
Filename :
1054603
Link To Document :
