|
|
|
Publications in Math-Net.Ru |
Citations |
|
1983 |
| 1. |
G. V. Zaitsev, V. A. Zinov'ev, N. V. Semakov, “Minimum-Check-Density Codes for Correcting Bytes of Errors, Erasures, or Defects”, Probl. Peredachi Inf., 19:3 (1983), 29–37    ; Problems Inform. Transmission, 19:3 (1983), 197–204 |
1
|
| 2. |
G. V. Zaitsev, N. E. Nagulin, “Class of Fast Fourier Transform Algorithms for a Real Sequence”, Probl. Peredachi Inf., 19:1 (1983), 49–60 ; Problems Inform. Transmission, 19:1 (1983), 40–49 |
|
1974 |
| 3. |
L. A. Bassalygo, G. V. Zaitsev, V. A. Zinov'ev, “Uniformly Packed Codes”, Probl. Peredachi Inf., 10:1 (1974), 9–14 ; Problems Inform. Transmission, 10:1 (1974), 6–9 |
16
|
|
1971 |
| 4. |
N. V. Semakov, V. A. Zinov'ev, G. V. Zaitsev, “Uniformly Packed Codes”, Probl. Peredachi Inf., 7:1 (1971), 38–50 ; Problems Inform. Transmission, 7:1 (1971), 30–39 |
28
|
|
1969 |
| 5. |
N. V. Semakov, V. A. Zinov'ev, G. V. Zaitsev, “A Class of Maximum Equidistant Codes”, Probl. Peredachi Inf., 5:2 (1969), 84–87 ; Problems Inform. Transmission, 5:2 (1969), 65–68 |
19
|
| |
|
|
Contact us: