|
|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
| 1. |
P. Boyvalenkov, K. Delchev, V. A. Zinov'ev, D. V. Zinov'ev, “On codes with distances $d$ and $n$”, Probl. Peredachi Inf., 58:4 (2022), 62–83  |
1
|
|
2020 |
| 2. |
P. Boyvalenkov, K. Delchev, D. V. Zinoviev, V. A. Zinoviev, “On $q$-ary codes with two distances $d$ and $d+1$”, Probl. Peredachi Inf., 56:1 (2020), 38–50  ; Problems Inform. Transmission, 56:1 (2020), 33–44   |
8
|
|
2018 |
| 3. |
P. Boyvalenkov, D. Danev, M. Stoyanova, “Refinements of Levenshtein bounds in $q$-ary Hamming spaces”, Probl. Peredachi Inf., 54:4 (2018), 35–50 ; Problems Inform. Transmission, 54:4 (2018), 329–342 |
1
|
|
2015 |
| 4. |
P. Boyvalenkov, H. Kulina, T. Marinova, M. Stoyanova, “Nonexistence of binary orthogonal arrays via their distance distributions”, Probl. Peredachi Inf., 51:4 (2015), 23–31 ; Problems Inform. Transmission, 51:4 (2015), 326–334 |
3
|
|
2013 |
| 5. |
P. Boyvalenkov, H. Kulina, “Investigation of binary orthogonal arrays via their distance distributions”, Probl. Peredachi Inf., 49:4 (2013), 28–40 ; Problems Inform. Transmission, 49:4 (2013), 322–332 |
8
|
|
2009 |
| 6. |
S. Boumova, P. Boyvalenkov, M. Stoyanova, “A method for proving nonexistence of spherical designs of odd strength and odd cardinality”, Probl. Peredachi Inf., 45:2 (2009), 41–55   ; Problems Inform. Transmission, 45:2 (2009), 110–123 |
3
|
|
1998 |
| 7. |
P. Boyvalenkov, D. Danev, “On Linear Programming Bounds for Codes in Polynomial Metric Spaces”, Probl. Peredachi Inf., 34:2 (1998), 16–31 ; Problems Inform. Transmission, 34:2 (1998), 108–120 |
4
|
|
| Presentations in Math-Net.Ru |
|
|
| Organisations |
|
| |
|
|
Contact us: