| Publications in Math-Net.Ru |
|
2017 |
| 1. |
F. K. Nilov, A. A. Polyanskii, N. A. Polyanskii, “Теорема Семереди–Троттера”, Mat. Pros., Ser. 3, 21 (2017), 186–196  |
|
2016 |
| 2. |
A. G. D'yachkov, I. V. Vorob'ev, N. A. Polyansky, V. Yu. Shchukin, “Erratum to: “Bounds on the rate of disjunctive codes” [Problems of Information Transmission 50, 27 (2014)]”, Probl. Peredachi Inf., 52:2 (2016), 111  ; Problems Inform. Transmission, 52:2 (2016), 200   |
| 3. |
N. A. Polyansky, “Almost cover-free codes”, Probl. Peredachi Inf., 52:2 (2016), 46–60  ; Problems Inform. Transmission, 52:2 (2016), 142–155 |
|
2015 |
| 4. |
A. G. D'yachkov, I. V. Vorob'ev, N. A. Polyansky, V. Yu. Shchukin, “Almost disjunctive list-decoding codes”, Probl. Peredachi Inf., 51:2 (2015), 27–49 ; Problems Inform. Transmission, 51:2 (2015), 110–131 |
|
2014 |
| 5. |
A. G. D'yachkov, A. N. Kuzina, N. A. Polyansky, A. Macula, V. V. Rykov, “DNA codes for nonadditive stem similarity”, Probl. Peredachi Inf., 50:3 (2014), 51–75 ; Problems Inform. Transmission, 50:3 (2014), 247–269 |
| 6. |
A. G. D'yachkov, I. V. Vorob'ev, N. A. Polyansky, V. Yu. Shchukin, “Bounds on the rate of disjunctive codes”, Probl. Peredachi Inf., 50:1 (2014), 31–63 ; Problems Inform. Transmission, 50:1 (2014), 27–56 |
|
Terms of Use