The Correction of Errors of Multiplicity $t\geq\frac{d}{2}$ in Majority Decoding

The efficiency of the correction of symbols in the shift register is demonstrated for majority decoding. Sufficient conditions are found for the correction of several errors of multiplicity $t\geq\frac{d}{2}$. Two different methods are considered for passing from the detection to the correction of errors in the case of an even code distance.