DocumentCode :
920936
Title :
On binary majority-logic decodable codes (Corresp.)
Author :
Shiva, Sajjan ; Tavares, Sergio
Author_Institution :
Univ. of Ottawa, Ottawa, Ont., Canada
Volume :
20
Issue :
1
fYear :
1974
fDate :
1/1/1974 12:00:00 AM
Firstpage :
131
Lastpage :
133
Abstract :
Let 
be a binary 
majority-logic decodable code with 
as its generator polynomial and odd minimum distance 
. Let 
be the 
subset code generated by 
). This correspondence shows that is majority-logic deeodable with 
orthogonal estimates. This fact is useful in the simultaneous correction of random errors and erasures.
be a binary majority-logic decodable code with as its generator polynomial and odd minimum distance . Let be the subset code generated by ). This correspondence shows that is majority-logic deeodable with orthogonal estimates. This fact is useful in the simultaneous correction of random errors and erasures.Keywords :
Coding; Majority logic decoding; Decoding; Entropy; Error correction; Error correction codes; Information science; NASA; Navigation; Uncertainty; Welding;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.1974.1055151
Filename :
1055151
Link To Document :
