Boyarinov Igor Markovich

Publications in Math-Net.Ru

1. Self-checking Circuits and Decoding Algorithms for Binary Hamming and BCH Codes and Reed–Solomon Codes over $GF(2^m)$
   
   Probl. Peredachi Inf., 44:2 (2008),  32–45
2. Two-Dimensional Array Codes Correcting Rectangular Burst Errors
   
   Probl. Peredachi Inf., 42:2 (2006),  26–43
3. A Class of Composite Codes with Minimum Distance 8
   
   Probl. Peredachi Inf., 37:4 (2001),  85–96
4. On the Decoding of Preparata Codes
   
   Probl. Peredachi Inf., 35:4 (1999),  47–58
5. Error correction in main memory of a fast computer
   
   Avtomat. i Telemekh., 1987, no. 7,  152–165
6. Use of noise-tolerant encoding for data protection from operators errors
   
   Avtomat. i Telemekh., 1983, no. 2,  5–49
7. Arithmetic $(n,A)$-Codes Dual to Iterative Codes
   
   Probl. Peredachi Inf., 19:3 (1983),  102–106
8. Combined Decoding Methods for Linear Codes with Unequal Protection of Information Symbols
   
   Probl. Peredachi Inf., 19:1 (1983),  21–29
9. Method of Decoding Direct Sums of Products of Codes and Its Applications
   
   Probl. Peredachi Inf., 17:2 (1981),  39–51
10. Correction of errors by direct sums of iterative and cascade codes
    
    Dokl. Akad. Nauk SSSR, 252:3 (1980),  563–565
11. On a Construction of Linear Codes with Unequal Protection of Information Symbols
    
    Probl. Peredachi Inf., 16:2 (1980),  103–107
12. Iterative Arithmetic Independent-Error-Correcting Codes
    
    Probl. Peredachi Inf., 15:1 (1979),  38–49
13. Perfect Arithmetic Single-Error-Correcting $AN$-Codes
    
    Probl. Peredachi Inf., 12:1 (1976),  16–23
14. Arithmetic $(n,A)$ codes over an arbitrary base
    
    Dokl. Akad. Nauk SSSR, 221:4 (1975),  794–797
15. Nonbinary Arithmetic Codes with Large Minimum Distance
    
    Probl. Peredachi Inf., 11:1 (1975),  57–63
16. Bounded-Density Burst-Error-Correcting Codes
    
    Probl. Peredachi Inf., 9:1 (1973),  104–107
17. Decoding of Burst-Error-Correcting $AN$-Codes
    
    Probl. Peredachi Inf., 8:2 (1972),  111–112
18. A Class of Cyclic Codes which Correct Error Bursts without Gaps
    
    Probl. Peredachi Inf., 6:4 (1970),  91–93