|
|
|
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
|
|
1971 |
| 2. |
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 |
| 3. |
N. V. Semakov, V. A. Zinov'ev, “Balanced Codes and Tactical Configurations”, Probl. Peredachi Inf., 5:3 (1969), 28–36 ; Problems Inform. Transmission, 5:3 (1969), 22–28 |
18
|
| 4. |
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
|
| 5. |
N. V. Semakov, V. A. Zinov'ev, “Complete and Quasi-complete Balanced Codes”, Probl. Peredachi Inf., 5:2 (1969), 14–18 ; Problems Inform. Transmission, 5:2 (1969), 11–13 |
7
|
|
1968 |
| 6. |
N. V. Semakov, V. A. Zinov'ev, “Equidistant $q$-ary Codes with Maximal Distance and Resolvable Balanced Incomplete Block Designs”, Probl. Peredachi Inf., 4:2 (1968), 3–10 ; Problems Inform. Transmission, 4:2 (1968), 1–7 |
16
|
| |
|
|
Contact us: