DocumentCode :
912845
Title :
A new class of recurrent codes
Author :
Hsu, Harry T.
Volume :
15
Issue :
5
fYear :
1969
fDate :
9/1/1969 12:00:00 AM
Firstpage :
592
Lastpage :
597
Abstract :
Recurrent codes for burst-error correction are defined to be a type B1 code. A type B1 code is capable of correcting all the single burst errors of length l or less. A type B2 code is a subclass of a type B1 code with the restriction that the single burst error of length l or less occurs within r consecutive blocks (it is assumed that l is divisible by b and l = rb ). In this paper, the author will present a class of q -nary recurrent codes--both type B1 and B2 codes--for burst-error correction. The construction procedures for this class of codes are simple and systematic. An interesting relation exists between a type B1 and a type B2 code. If a code is type B2 (with block length b , burst-error-correction capability l = rb ), then by reducing the block length by one symbol, the type B2 code becomes a type B1 code, while the burst-error-correction capability remains the same. Both types of codes can be used for the correction of binary burst errors. The correction of binary burst errors will be briefly discussed in this paper.
Keywords :
Burst-correcting codes; Convolutional codes; Ash; Bismuth; Computer errors; Computer science; Decoding; Equations; Error correction; Error correction codes; Matrix converters; Parity check codes;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1969.1054357
Filename :
1054357
Link To Document :
بازگشت