|
|
|
Publications in Math-Net.Ru |
Citations |
|
2023 |
| 1. |
A. Trofimov, F. Taubin, “Performance analysis of concatenated coding to increase the endurance of multilevel NAND flash memory”, Informatics and Automation, 22:2 (2023), 316–348  |
|
2019 |
| 2. |
F. A. Taubin, A. N. Trofimov, “Concatenated coding for multilevel flash memory with low error correction capabilities in outer stage”, Tr. SPIIRAN, 18:5 (2019), 1149–1181  |
2
|
|
2018 |
| 3. |
F. A. Taubin, A. N. Trofimov, “Concatenated Reed–Solomon/lattice coding for multilevel flash memory”, Tr. SPIIRAN, 57 (2018), 75–103 |
2
|
|
1999 |
| 4. |
A. N. Trofimov, K. Sh. Zigangirov, “A Posteriori Probability Decoding of Convolutional Codes”, Probl. Peredachi Inf., 35:4 (1999), 74–83   ; Problems Inform. Transmission, 35:4 (1999), 351–358 |
1
|
|
1993 |
| 5. |
A. N. Trofimov, “Distance Spectra of Lattice-Based Codes”, Probl. Peredachi Inf., 29:2 (1993), 28–40 ; Problems Inform. Transmission, 29:2 (1993), 119–131 |
| 6. |
A. N. Trofimov, “Multidimensional Lattices and Limit Efficiency of Modulation and Coding”, Probl. Peredachi Inf., 29:1 (1993), 32–44 ; Problems Inform. Transmission, 29:1 (1993), 27–37 |
|
1991 |
| 7. |
A. N. Trofimov, “Convolutional Codes for Channels with Fading”, Probl. Peredachi Inf., 27:2 (1991), 75–85 ; Problems Inform. Transmission, 27:2 (1991), 155–165 |
|
1990 |
| 8. |
F. A. Taubin, A. N. Trofimov, “Pipeline Decoding of Embedded Trellis Codes: Error-Tolerance Analysis”, Probl. Peredachi Inf., 26:4 (1990), 56–70 ; Problems Inform. Transmission, 26:4 (1990), 332–343 |
|
1986 |
| 9. |
A. N. Trofimov, F. A. Taubin, “A Bound on Decoding Error Probability in a Noisy Multiple-Access Channel”, Probl. Peredachi Inf., 22:3 (1986), 3–15 ; Problems Inform. Transmission, 22:3 (1986), 159–169 |
|
1980 |
| 10. |
M. A. Kazaryan, G. G. Petrash, A. N. Trofimov, “Comparison of the characteristics of copper, copper chloride, and copper bromide vapor lasers”, Kvantovaya Elektronika, 7:3 (1980), 583–592 [Sov J Quantum Electron, 10:3 (1980), 328–333  ] |
15
|
|
| Organisations |
|
| |
|
|
Contact us: