|
|
|
Publications in Math-Net.Ru |
Citations |
|
1995 |
| 1. |
G. L. Katsman, “Upper Bounds on the Probability of Nondetected Error”, Probl. Peredachi Inf., 31:1 (1995), 13–16   ; Problems Inform. Transmission, 31:1 (1995), 10–13 |
1
|
|
1993 |
| 2. |
V. A. Zinov'ev, G. L. Katsman, “Universal Code Families”, Probl. Peredachi Inf., 29:2 (1993), 3–8  ; Problems Inform. Transmission, 29:2 (1993), 95–100 |
1
|
|
1987 |
| 3. |
G. L. Katsman, M. A. Tsfasman, “Spectra of Algebraic-Geometric Codes”, Probl. Peredachi Inf., 23:4 (1987), 19–34 ; Problems Inform. Transmission, 23:4 (1987), 262–275 |
3
|
| 4. |
A. M. Barg, G. L. Katsman, M. A. Tsfasman, “Algebraic-Geometric Codes from Curves of Small Genus”, Probl. Peredachi Inf., 23:1 (1987), 42–46 ; Problems Inform. Transmission, 23:1 (1987), 34–38 |
1
|
|
1986 |
| 5. |
G. L. Katsman, S. N. Litsyn, “Dual fail-safe separating systems”, Avtomat. i Telemekh., 1986, no. 11, 114–117 ; Autom. Remote Control, 47:11 (1986), 1559–1562 |
|
1984 |
| 6. |
S. G. Vlăduţ, G. L. Katsman, M. A. Tsfasman, “Modular Curves and Codes with Polynomial Construction Complexity”, Probl. Peredachi Inf., 20:1 (1984), 47–55 ; Problems Inform. Transmission, 20:1 (1984), 35–42 |
2
|
|
1982 |
| 7. |
G. L. Katsman, S. L. Portnoi, “On One Modification of the Majority Decoding Algorithm”, Probl. Peredachi Inf., 18:1 (1982), 38–42 ; Problems Inform. Transmission, 18:1 (1982), 31–35 |
|
1981 |
| 8. |
G. L. Katsman, “On Packing Density for Unit Spheres in Hamming Space”, Probl. Peredachi Inf., 17:2 (1981), 52–56 ; Problems Inform. Transmission, 17:2 (1981), 114–117 |
|
1980 |
| 9. |
G. L. Katsman, “Bounds on Volume of Linear Codes with Unequal Information-Symbol Protection”, Probl. Peredachi Inf., 16:2 (1980), 25–32 ; Problems Inform. Transmission, 16:2 (1980), 99–105 |
| 10. |
G. L. Katsman, “Lower Bounds for the Volume of Error-Correcting Codes in Channels with Multiple Access”, Probl. Peredachi Inf., 16:1 (1980), 35–41 ; Problems Inform. Transmission, 16:1 (1980), 25–30 |
| |
|
|
Contact us: