1. I. N. Kovalenko, “On an algorithm of subexponential complexity for decoding heavily corrupted linear codes,” Dop. AN URSR, Ser. A, No. 10, 16–17 (1988).
2. I. N. Kovalenko and M. N. Savchuk, “Some methods of decoding corrupted linear codes,” Data Registration, Storage, and Processing, 1, No. 2, 62–68 (1999).
3. I. N. Kovalenko and M. N. Savchuk, “On a statistical algorithm to decode heavily corrupted linear codes,” in: Applied Probability and Stochastic Processes, Kluwer, Berkeley (1999), pp. 73–82.
4. K. Efremov and M. Savchuk, “Estimates of complexity and reliability of algorithms of decoding heavily corrupted linear codes,” in: Proc. IXth Intern. Sci.-Pract. Conf. “Information Security in Informational-Telecommunication Systems,” Kiev (2006), p. 24.
5. A. N. Alekseychuk, “Systems of linear equations with corrupted right sides over a residue ring modulo 2 N ,” Zakhist Informatsii, No. 4, 12–19 (2001).