DocumentCode :
916401
Title :
A note on the decoding of double-error-correcting binary BCH codes of primitive length (Corresp.)
Author :
Hartmann, C.
Volume :
17
Issue :
6
fYear :
1971
fDate :
11/1/1971 12:00:00 AM
Firstpage :
765
Lastpage :
766
Abstract :
In this correspondence a complete decoding algorithm for double-error-correcting binary BCH codes of length 
is introduced. It corrects all patterns of one and two errors and all patterns of three errors that belong to cosets that have a coset leader of weight three. This algorithm is based on the step-by-step decoding algorithm introduced by Prange and the decoding algorithm introduced by Meggitt, which makes use of the cyclic properties of the code. A comparison between this method and previously existing ones is also given.
is introduced. It corrects all patterns of one and two errors and all patterns of three errors that belong to cosets that have a coset leader of weight three. This algorithm is based on the step-by-step decoding algorithm introduced by Prange and the decoding algorithm introduced by Meggitt, which makes use of the cyclic properties of the code. A comparison between this method and previously existing ones is also given.Keywords :
BCH codes; Decoding; Artificial intelligence; Ash; Cities and towns; Convolutional codes; Decoding; Error correction; Error correction codes; Laboratories; Network address translation; Telephony;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1971.1054704
Filename :
1054704
Link To Document :
