|
|
|
Publications in Math-Net.Ru |
Citations |
|
2008 |
| 1. |
I. M. Boyarinov, “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   ; Problems Inform. Transmission, 44:2 (2008), 99–111   |
3
|
|
2006 |
| 2. |
I. M. Boyarinov, “Two-Dimensional Array Codes Correcting Rectangular Burst Errors”, Probl. Peredachi Inf., 42:2 (2006), 26–43 ; Problems Inform. Transmission, 42:2 (2006), 90–105 |
6
|
|
2001 |
| 3. |
I. M. Boyarinov, I. Martin, B. Honary, “A Class of Composite Codes with Minimum Distance 8”, Probl. Peredachi Inf., 37:4 (2001), 85–96  ; Problems Inform. Transmission, 37:4 (2001), 353–364 |
|
1999 |
| 4. |
I. M. Boyarinov, “On the Decoding of Preparata Codes”, Probl. Peredachi Inf., 35:4 (1999), 47–58 ; Problems Inform. Transmission, 35:4 (1999), 327–337 |
|
1987 |
| 5. |
I. M. Boyarinov, A. A. Davydov, B. M. Shabanov, “Error correction in main memory of a fast computer”, Avtomat. i Telemekh., 1987, no. 7, 152–165 |
|
1983 |
| 6. |
I. M. Boyarinov, A. A. Davydov, È. M. Mamedli, Yu. B. Smerkis, “Use of noise-tolerant encoding for data protection from operators errors”, Avtomat. i Telemekh., 1983, no. 2, 5–49 ; Autom. Remote Control, 44:2 (1983), 141–177 |
1
|
| 7. |
I. M. Boyarinov, “Arithmetic $(n,A)$-Codes Dual to Iterative Codes”, Probl. Peredachi Inf., 19:3 (1983), 102–106 |
| 8. |
I. M. Boyarinov, “Combined Decoding Methods for Linear Codes with Unequal Protection of Information Symbols”, Probl. Peredachi Inf., 19:1 (1983), 21–29 ; Problems Inform. Transmission, 19:1 (1983), 17–25 |
|
1981 |
| 9. |
I. M. Boyarinov, “Method of Decoding Direct Sums of Products of Codes and Its Applications”, Probl. Peredachi Inf., 17:2 (1981), 39–51 ; Problems Inform. Transmission, 17:2 (1981), 104–113 |
2
|
|
1980 |
| 10. |
I. M. Boyarinov, “Correction of errors by direct sums of iterative and cascade codes”, Dokl. Akad. Nauk SSSR, 252:3 (1980), 563–565 |
| 11. |
I. M. Boyarinov, “On a Construction of Linear Codes with Unequal Protection of Information Symbols”, Probl. Peredachi Inf., 16:2 (1980), 103–107 |
|
1979 |
| 12. |
I. M. Boyarinov, G. A. Kabatiansky, “Iterative Arithmetic Independent-Error-Correcting Codes”, Probl. Peredachi Inf., 15:1 (1979), 38–49 ; Problems Inform. Transmission, 15:1 (1979), 27–36 |
|
1976 |
| 13. |
I. M. Boyarinov, G. A. Kabatiansky, “Perfect Arithmetic Single-Error-Correcting $AN$-Codes”, Probl. Peredachi Inf., 12:1 (1976), 16–23 ; Problems Inform. Transmission, 12:1 (1976), 10–16 |
|
1975 |
| 14. |
I. M. Boyarinov, G. A. Kabatiansky, “Arithmetic $(n,A)$ codes over an arbitrary base”, Dokl. Akad. Nauk SSSR, 221:4 (1975), 794–797 |
| 15. |
I. M. Boyarinov, “Nonbinary Arithmetic Codes with Large Minimum Distance”, Probl. Peredachi Inf., 11:1 (1975), 57–63 ; Problems Inform. Transmission, 1:11 (1975), 44–49 |
|
1973 |
| 16. |
I. M. Boyarinov, “Bounded-Density Burst-Error-Correcting Codes”, Probl. Peredachi Inf., 9:1 (1973), 104–107 ; Problems Inform. Transmission, 9:1 (1973), 80–83 |
|
1972 |
| 17. |
I. M. Boyarinov, “Decoding of Burst-Error-Correcting $AN$-Codes”, Probl. Peredachi Inf., 8:2 (1972), 111–112 ; Problems Inform. Transmission, 8:2 (1972), 170–171 |
|
1970 |
| 18. |
I. M. Boyarinov, “A Class of Cyclic Codes which Correct Error Bursts without Gaps”, Probl. Peredachi Inf., 6:4 (1970), 91–93 ; Problems Inform. Transmission, 6:4 (1970), 358–360 |
|
| Organisations |
|
| |
|
|
Contact us: