|
|
|
Publications in Math-Net.Ru |
Citations |
|
2020 |
| 1. |
N. L. Manev, “On distance distributions of orthogonal arrays”, Probl. Peredachi Inf., 56:1 (2020), 51–62   ; Problems Inform. Transmission, 56:1 (2020), 45–55   |
3
|
|
1998 |
| 2. |
Yu. F. Borisov, N. L. Manev, “Minimal Codewords of the Primitive BCH Codes”, Probl. Peredachi Inf., 34:3 (1998), 37–46   ; Problems Inform. Transmission, 34:3 (1998), 238–246 |
|
1994 |
| 3. |
E. Kolev, N. L. Manev, “Binary Weight Spectrum of the Extended $[2^m,5]$ Reed–Solomon Code and its Dual Code”, Probl. Peredachi Inf., 30:3 (1994), 38–46 ; Problems Inform. Transmission, 30:3 (1994), 224–231 |
|
1987 |
| 4. |
S. M. Dodunekov, N. L. Manev, “An Improvement of Greismer Bound for Some Classes of Distances”, Probl. Peredachi Inf., 23:1 (1987), 47–56 ; Problems Inform. Transmission, 23:1 (1987), 38–46 |
3
|
|
1984 |
| 5. |
S. M. Dodunekov, N. L. Manev, “Minimum Possible Block Length of a Linear Binary Code for Some Distances”, Probl. Peredachi Inf., 20:1 (1984), 12–18 ; Problems Inform. Transmission, 20:1 (1984), 8–14 |
3
|
|
1983 |
| 6. |
S. M. Dodunekov, N. L. Manev, “Characterization of Two Classes of Codes that Attain the Griesmer Bound”, Probl. Peredachi Inf., 19:4 (1983), 3–10 ; Problems Inform. Transmission, 19:4 (1983), 253–259 |
3
|
|
| Organisations |
|
| |
|
|
Contact us: