|
|
|
Publications in Math-Net.Ru |
Citations |
|
2020 |
| 1. |
A. V. Kharin, K. N. Zavertkin, A. A. Ovinnikov, “Detecting cycles of length $10$ in the Tanner graph of a QC-LDPC code based on protograph analysis”, Probl. Peredachi Inf., 56:4 (2020), 19–34  ; Problems Inform. Transmission, 56:4 (2020), 317–331  |
4
|
| 2. |
A. V. Kharin, K. N. Zavertkin, A. A. Ovinnikov, “Detecting cycles of length 8 in the Tanner graph of a QC-LDPC code based on protograph analysis”, Probl. Peredachi Inf., 56:2 (2020), 82–94  ; Problems Inform. Transmission, 56:2 (2020), 173–184  |
5
|
|
| Organisations |
|
|
Contact us: