Possibility of construction of cyclic codes with correction of repeated errors is analysed. Forming and verifying polynomials for construction of the cyclic codes are offered, allowing to rectify two, three and fourfould errors in the accepted code combination. Parity-check matrixes for such codes are gained. The algorithm three line-of-communication machining by the decoder of a syndrome of the accepted combination of the cyclic code is offered and proved, allowing essentially to devide out memory size of the decoder and number of settlement operations for definition of the distorted categories.
a cyclic code, a regular code, a syndrome, a signal distance, the coder, the decoder