Abstract: We studied theoretically conditions of correct operation of a new soft decisions decoder of Reed-Muller second order codes over the field \(\mathbb F_3\), whose experimental research showed that its corrective ability exceeds that of the decoder of the minimum Hamming's distance. For discrete data channel allocated we indicated the smoothness condition under which the decoder guarantees correction of all errors, the number of which does not exceed the permissible number of errors referred to the code design.
2. Prokis Dzh. Tsifrovaya svyaz'. Moscow, Radio i svyaz', 2000. 800 p. [in Russian].
3. Sidel'nikov V.M., Pershakov A.S. Dekodirovanie kodov Rida-Mallera
pri bol'shom chisle oshibok, Problemy peredachi informatsii
[Problems Inform. Transmission], 1992, vol. 28, no. 3, pp. 80-94 [in
4. Loidreau P., Sakkour B. Modified version of Sidel'nikov-Pershakov
decoding algorithm for binary second order Reed-Muller codes. Ninth
International Workshop on Algebraic and Combinatorial Coding theory.
Kranevo, 2004, pp. 266-271.