|
|
|
Publications in Math-Net.Ru |
Citations |
|
2021 |
| 1. |
P. A. Panteleev, G. V. Kalachev, “On asymptotically good families of classical and quantum LDPC codes”, Intelligent systems. Theory and applications, 25:4 (2021), 185–188  |
|
2020 |
| 2. |
G. V. Kalachev, P. A. Panteleev, “On the minimum distance in one class of quantum LDPC codes”, Intelligent systems. Theory and applications, 24:4 (2020), 87–117 |
|
2018 |
| 3. |
P. A. Panteleev, “A generalization of a Moore theorem”, Intelligent systems. Theory and applications, 22:1 (2018), 151–154 |
1
|
|
2016 |
| 4. |
È. È. Gasanov, P. A. Panteleev, A. Sokolov, Yu. S. Shutkin, “Hardware implementation of on-the-fly reconfigurable BCH decoder”, Intelligent systems. Theory and applications, 20:2 (2016), 53–66 |
|
2015 |
| 5. |
S. V. Aleshin, P. A. Panteleev, “Finite automata and numbers”, Diskr. Mat., 27:4 (2015), 3–20   ; Discrete Math. Appl., 26:3 (2016), 131–144   |
|
2003 |
| 6. |
P. A. Panteleev, “On the distinguishability of states of automata”, Diskr. Mat., 15:3 (2003), 76–90  ; Discrete Math. Appl., 13:4 (2003), 355–370 |
|
| Organisations |
|
| |
|
|
Contact us: